./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 839c364b 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-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 14:52:16,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 14:52:16,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 14:52:16,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 14:52:16,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 14:52:16,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 14:52:16,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 14:52:16,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 14:52:16,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 14:52:16,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 14:52:16,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 14:52:16,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 14:52:16,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 14:52:16,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 14:52:16,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 14:52:16,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 14:52:16,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 14:52:16,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 14:52:16,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 14:52:16,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 14:52:16,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 14:52:16,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 14:52:16,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 14:52:16,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 14:52:16,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 14:52:16,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 14:52:16,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 14:52:16,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 14:52:16,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 14:52:16,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 14:52:16,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 14:52:16,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 14:52:16,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 14:52:16,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 14:52:16,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 14:52:16,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 14:52:16,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 14:52:16,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 14:52:16,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 14:52:16,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 14:52:16,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 14:52:16,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 14:52:16,264 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 14:52:16,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 14:52:16,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 14:52:16,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 14:52:16,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 14:52:16,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 14:52:16,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 14:52:16,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 14:52:16,266 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 14:52:16,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 14:52:16,267 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 14:52:16,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 14:52:16,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 14:52:16,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 14:52:16,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 14:52:16,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 14:52:16,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 14:52:16,268 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 14:52:16,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 14:52:16,269 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 14:52:16,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 14:52:16,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 14:52:16,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 14:52:16,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 14:52:16,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:52:16,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 14:52:16,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 14:52:16,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 14:52:16,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 14:52:16,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 14:52:16,270 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 14:52:16,271 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 14:52:16,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 14:52:16,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 14:52:16,271 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 [2021-12-14 14:52:16,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 14:52:16,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 14:52:16,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 14:52:16,467 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 14:52:16,471 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 14:52:16,472 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 [2021-12-14 14:52:16,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5711bfbe5/b73b7a6ba97a4f6baf5720a583331142/FLAG21481dd12 [2021-12-14 14:52:16,850 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 14:52:16,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-12-14 14:52:16,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5711bfbe5/b73b7a6ba97a4f6baf5720a583331142/FLAG21481dd12 [2021-12-14 14:52:16,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5711bfbe5/b73b7a6ba97a4f6baf5720a583331142 [2021-12-14 14:52:16,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 14:52:16,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 14:52:16,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 14:52:16,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 14:52:16,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 14:52:16,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:52:16" (1/1) ... [2021-12-14 14:52:16,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb1fc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:16, skipping insertion in model container [2021-12-14 14:52:16,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:52:16" (1/1) ... [2021-12-14 14:52:16,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 14:52:16,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 14:52:16,991 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] [2021-12-14 14:52:17,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:52:17,041 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 14:52:17,048 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] [2021-12-14 14:52:17,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 14:52:17,083 INFO L208 MainTranslator]: Completed translation [2021-12-14 14:52:17,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17 WrapperNode [2021-12-14 14:52:17,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 14:52:17,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 14:52:17,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 14:52:17,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 14:52:17,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,126 INFO L137 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 215 [2021-12-14 14:52:17,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 14:52:17,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 14:52:17,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 14:52:17,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 14:52:17,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 14:52:17,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 14:52:17,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 14:52:17,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 14:52:17,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (1/1) ... [2021-12-14 14:52:17,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 14:52:17,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:17,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 14:52:17,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 14:52:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 14:52:17,228 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-14 14:52:17,228 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-14 14:52:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-14 14:52:17,229 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-14 14:52:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-14 14:52:17,229 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-14 14:52:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-14 14:52:17,229 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-14 14:52:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-14 14:52:17,229 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-14 14:52:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 14:52:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-14 14:52:17,230 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-14 14:52:17,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 14:52:17,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 14:52:17,274 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 14:52:17,275 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 14:52:17,480 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 14:52:17,485 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 14:52:17,486 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 14:52:17,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:52:17 BoogieIcfgContainer [2021-12-14 14:52:17,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 14:52:17,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 14:52:17,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 14:52:17,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 14:52:17,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:52:16" (1/3) ... [2021-12-14 14:52:17,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a27057a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:52:17, skipping insertion in model container [2021-12-14 14:52:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:52:17" (2/3) ... [2021-12-14 14:52:17,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a27057a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:52:17, skipping insertion in model container [2021-12-14 14:52:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:52:17" (3/3) ... [2021-12-14 14:52:17,492 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-12-14 14:52:17,495 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 14:52:17,496 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 14:52:17,524 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 14:52:17,530 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 14:52:17,531 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 14:52:17,553 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) [2021-12-14 14:52:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 14:52:17,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:17,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:17,560 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1624964503, now seen corresponding path program 1 times [2021-12-14 14:52:17,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:17,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445942031] [2021-12-14 14:52:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:17,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:17,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:17,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:17,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:17,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:17,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445942031] [2021-12-14 14:52:17,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445942031] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:17,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:17,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 14:52:17,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643087471] [2021-12-14 14:52:17,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:17,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 14:52:17,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:17,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 14:52:17,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 14:52:17,833 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) [2021-12-14 14:52:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:18,375 INFO L93 Difference]: Finished difference Result 339 states and 511 transitions. [2021-12-14 14:52:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 14:52:18,377 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 [2021-12-14 14:52:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:18,385 INFO L225 Difference]: With dead ends: 339 [2021-12-14 14:52:18,385 INFO L226 Difference]: Without dead ends: 233 [2021-12-14 14:52:18,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-14 14:52:18,390 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 293 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:18,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 477 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 14:52:18,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-14 14:52:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2021-12-14 14:52:18,448 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) [2021-12-14 14:52:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 272 transitions. [2021-12-14 14:52:18,450 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 272 transitions. Word has length 56 [2021-12-14 14:52:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:18,450 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 272 transitions. [2021-12-14 14:52:18,450 INFO L471 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) [2021-12-14 14:52:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 272 transitions. [2021-12-14 14:52:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 14:52:18,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:18,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:18,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 14:52:18,453 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash 713012507, now seen corresponding path program 1 times [2021-12-14 14:52:18,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:18,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148614718] [2021-12-14 14:52:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:18,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:18,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:18,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:18,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:18,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:18,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:18,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148614718] [2021-12-14 14:52:18,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148614718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:18,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:18,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 14:52:18,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124528214] [2021-12-14 14:52:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:18,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 14:52:18,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:18,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 14:52:18,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 14:52:18,539 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) [2021-12-14 14:52:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:19,019 INFO L93 Difference]: Finished difference Result 524 states and 746 transitions. [2021-12-14 14:52:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 14:52:19,020 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 [2021-12-14 14:52:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:19,028 INFO L225 Difference]: With dead ends: 524 [2021-12-14 14:52:19,028 INFO L226 Difference]: Without dead ends: 341 [2021-12-14 14:52:19,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-14 14:52:19,030 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 274 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:19,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 719 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 14:52:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-14 14:52:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 277. [2021-12-14 14:52:19,049 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) [2021-12-14 14:52:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 389 transitions. [2021-12-14 14:52:19,051 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 389 transitions. Word has length 56 [2021-12-14 14:52:19,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:19,051 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 389 transitions. [2021-12-14 14:52:19,051 INFO L471 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) [2021-12-14 14:52:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 389 transitions. [2021-12-14 14:52:19,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 14:52:19,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:19,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:19,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 14:52:19,053 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:19,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1336375335, now seen corresponding path program 1 times [2021-12-14 14:52:19,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:19,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830716945] [2021-12-14 14:52:19,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:19,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:19,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:19,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830716945] [2021-12-14 14:52:19,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830716945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:19,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:19,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 14:52:19,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226313864] [2021-12-14 14:52:19,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:19,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 14:52:19,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:19,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 14:52:19,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 14:52:19,128 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) [2021-12-14 14:52:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:19,631 INFO L93 Difference]: Finished difference Result 860 states and 1213 transitions. [2021-12-14 14:52:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 14:52:19,632 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 [2021-12-14 14:52:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:19,634 INFO L225 Difference]: With dead ends: 860 [2021-12-14 14:52:19,634 INFO L226 Difference]: Without dead ends: 592 [2021-12-14 14:52:19,635 INFO L932 BasicCegarLoop]: 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 [2021-12-14 14:52:19,636 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 328 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:19,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 697 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 14:52:19,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-12-14 14:52:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 442. [2021-12-14 14:52:19,660 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) [2021-12-14 14:52:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 620 transitions. [2021-12-14 14:52:19,662 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 620 transitions. Word has length 56 [2021-12-14 14:52:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:19,662 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 620 transitions. [2021-12-14 14:52:19,663 INFO L471 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) [2021-12-14 14:52:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 620 transitions. [2021-12-14 14:52:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 14:52:19,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:19,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:19,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 14:52:19,664 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2061198683, now seen corresponding path program 1 times [2021-12-14 14:52:19,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:19,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396679871] [2021-12-14 14:52:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:19,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:19,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:19,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396679871] [2021-12-14 14:52:19,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396679871] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:19,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:19,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 14:52:19,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80051342] [2021-12-14 14:52:19,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:19,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 14:52:19,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:19,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 14:52:19,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 14:52:19,755 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) [2021-12-14 14:52:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:20,200 INFO L93 Difference]: Finished difference Result 1382 states and 1944 transitions. [2021-12-14 14:52:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 14:52:20,200 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 [2021-12-14 14:52:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:20,204 INFO L225 Difference]: With dead ends: 1382 [2021-12-14 14:52:20,204 INFO L226 Difference]: Without dead ends: 949 [2021-12-14 14:52:20,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-14 14:52:20,206 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 271 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:20,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 680 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:52:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-12-14 14:52:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 741. [2021-12-14 14:52:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 595 states have (on average 1.4067226890756304) internal successors, (837), 604 states have internal predecessors, (837), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2021-12-14 14:52:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1042 transitions. [2021-12-14 14:52:20,245 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1042 transitions. Word has length 56 [2021-12-14 14:52:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:20,247 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 1042 transitions. [2021-12-14 14:52:20,247 INFO L471 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) [2021-12-14 14:52:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1042 transitions. [2021-12-14 14:52:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 14:52:20,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:20,258 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:20,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 14:52:20,258 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1985622119, now seen corresponding path program 1 times [2021-12-14 14:52:20,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:20,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432026176] [2021-12-14 14:52:20,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:20,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 14:52:20,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:20,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432026176] [2021-12-14 14:52:20,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432026176] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:20,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:20,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 14:52:20,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586394278] [2021-12-14 14:52:20,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:20,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 14:52:20,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 14:52:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 14:52:20,306 INFO L87 Difference]: Start difference. First operand 741 states and 1042 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) [2021-12-14 14:52:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:20,659 INFO L93 Difference]: Finished difference Result 2078 states and 2936 transitions. [2021-12-14 14:52:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 14:52:20,659 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 [2021-12-14 14:52:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:20,664 INFO L225 Difference]: With dead ends: 2078 [2021-12-14 14:52:20,664 INFO L226 Difference]: Without dead ends: 1347 [2021-12-14 14:52:20,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-14 14:52:20,667 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 383 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:20,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 550 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:52:20,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2021-12-14 14:52:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1142. [2021-12-14 14:52:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 913 states have (on average 1.3833515881708653) internal successors, (1263), 931 states have internal predecessors, (1263), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2021-12-14 14:52:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1576 transitions. [2021-12-14 14:52:20,704 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1576 transitions. Word has length 56 [2021-12-14 14:52:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:20,704 INFO L470 AbstractCegarLoop]: Abstraction has 1142 states and 1576 transitions. [2021-12-14 14:52:20,705 INFO L471 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) [2021-12-14 14:52:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1576 transitions. [2021-12-14 14:52:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-14 14:52:20,707 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:20,707 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:20,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 14:52:20,707 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:20,708 INFO L85 PathProgramCache]: Analyzing trace with hash -34790867, now seen corresponding path program 1 times [2021-12-14 14:52:20,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:20,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213829650] [2021-12-14 14:52:20,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:20,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 14:52:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-14 14:52:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 14:52:20,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213829650] [2021-12-14 14:52:20,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213829650] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065349551] [2021-12-14 14:52:20,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:20,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:20,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:20,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:20,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 14:52:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:20,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 14:52:20,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 14:52:21,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:21,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065349551] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:21,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:21,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 14:52:21,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751168124] [2021-12-14 14:52:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:21,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 14:52:21,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 14:52:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:52:21,119 INFO L87 Difference]: Start difference. First operand 1142 states and 1576 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) [2021-12-14 14:52:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:21,179 INFO L93 Difference]: Finished difference Result 3321 states and 4650 transitions. [2021-12-14 14:52:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 14:52:21,180 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 [2021-12-14 14:52:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:21,188 INFO L225 Difference]: With dead ends: 3321 [2021-12-14 14:52:21,188 INFO L226 Difference]: Without dead ends: 2190 [2021-12-14 14:52:21,193 INFO L932 BasicCegarLoop]: 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 [2021-12-14 14:52:21,197 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 114 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 397 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 [2021-12-14 14:52:21,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 397 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:52:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2021-12-14 14:52:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2190. [2021-12-14 14:52:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 1752 states have (on average 1.3692922374429224) internal successors, (2399), 1783 states have internal predecessors, (2399), 253 states have call successors, (253), 160 states have call predecessors, (253), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2021-12-14 14:52:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 3028 transitions. [2021-12-14 14:52:21,301 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 3028 transitions. Word has length 91 [2021-12-14 14:52:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:21,303 INFO L470 AbstractCegarLoop]: Abstraction has 2190 states and 3028 transitions. [2021-12-14 14:52:21,303 INFO L471 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) [2021-12-14 14:52:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 3028 transitions. [2021-12-14 14:52:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-14 14:52:21,309 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:21,309 INFO L514 BasicCegarLoop]: 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] [2021-12-14 14:52:21,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:21,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 14:52:21,527 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1902655295, now seen corresponding path program 1 times [2021-12-14 14:52:21,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:21,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790284406] [2021-12-14 14:52:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:21,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 14:52:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 14:52:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-14 14:52:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-14 14:52:21,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790284406] [2021-12-14 14:52:21,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790284406] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249970570] [2021-12-14 14:52:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:21,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:21,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:21,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:21,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 14:52:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:21,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 14:52:21,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 14:52:21,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:21,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249970570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:21,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:21,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-14 14:52:21,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737916767] [2021-12-14 14:52:21,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:21,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 14:52:21,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:21,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 14:52:21,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:52:21,872 INFO L87 Difference]: Start difference. First operand 2190 states and 3028 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) [2021-12-14 14:52:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:21,996 INFO L93 Difference]: Finished difference Result 6406 states and 8897 transitions. [2021-12-14 14:52:21,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 14:52:21,996 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 [2021-12-14 14:52:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:22,011 INFO L225 Difference]: With dead ends: 6406 [2021-12-14 14:52:22,011 INFO L226 Difference]: Without dead ends: 4230 [2021-12-14 14:52:22,016 INFO L932 BasicCegarLoop]: 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 [2021-12-14 14:52:22,018 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 69 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 279 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 [2021-12-14 14:52:22,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 279 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:52:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2021-12-14 14:52:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 4172. [2021-12-14 14:52:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4172 states, 3340 states have (on average 1.361377245508982) internal successors, (4547), 3400 states have internal predecessors, (4547), 473 states have call successors, (473), 310 states have call predecessors, (473), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2021-12-14 14:52:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 5708 transitions. [2021-12-14 14:52:22,159 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 5708 transitions. Word has length 117 [2021-12-14 14:52:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:22,159 INFO L470 AbstractCegarLoop]: Abstraction has 4172 states and 5708 transitions. [2021-12-14 14:52:22,159 INFO L471 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) [2021-12-14 14:52:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 5708 transitions. [2021-12-14 14:52:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-14 14:52:22,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:22,168 INFO L514 BasicCegarLoop]: 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] [2021-12-14 14:52:22,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:22,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-14 14:52:22,383 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:22,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash -844102889, now seen corresponding path program 1 times [2021-12-14 14:52:22,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:22,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511846494] [2021-12-14 14:52:22,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:22,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-14 14:52:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 14:52:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 14:52:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-14 14:52:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-14 14:52:22,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:22,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511846494] [2021-12-14 14:52:22,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511846494] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:22,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714506169] [2021-12-14 14:52:22,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:22,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:22,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:22,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:22,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 14:52:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:22,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 14:52:22,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-14 14:52:22,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:22,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714506169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:22,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:22,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 14:52:22,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10419888] [2021-12-14 14:52:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:22,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 14:52:22,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:22,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 14:52:22,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:52:22,670 INFO L87 Difference]: Start difference. First operand 4172 states and 5708 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) [2021-12-14 14:52:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:22,797 INFO L93 Difference]: Finished difference Result 7394 states and 10137 transitions. [2021-12-14 14:52:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 14:52:22,798 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 [2021-12-14 14:52:22,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:22,815 INFO L225 Difference]: With dead ends: 7394 [2021-12-14 14:52:22,815 INFO L226 Difference]: Without dead ends: 4500 [2021-12-14 14:52:22,823 INFO L932 BasicCegarLoop]: 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 [2021-12-14 14:52:22,824 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 101 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 290 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 [2021-12-14 14:52:22,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 290 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:52:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2021-12-14 14:52:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 4462. [2021-12-14 14:52:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4462 states, 3598 states have (on average 1.3343524180100055) internal successors, (4801), 3658 states have internal predecessors, (4801), 479 states have call successors, (479), 336 states have call predecessors, (479), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2021-12-14 14:52:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 6000 transitions. [2021-12-14 14:52:22,965 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 6000 transitions. Word has length 133 [2021-12-14 14:52:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:22,966 INFO L470 AbstractCegarLoop]: Abstraction has 4462 states and 6000 transitions. [2021-12-14 14:52:22,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2021-12-14 14:52:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 6000 transitions. [2021-12-14 14:52:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-14 14:52:22,974 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:22,974 INFO L514 BasicCegarLoop]: 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] [2021-12-14 14:52:22,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:23,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:23,187 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:23,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash -797474129, now seen corresponding path program 1 times [2021-12-14 14:52:23,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:23,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516414962] [2021-12-14 14:52:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:23,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 14:52:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 14:52:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 14:52:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 14:52:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 14:52:23,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:23,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516414962] [2021-12-14 14:52:23,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516414962] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:23,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304876787] [2021-12-14 14:52:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:23,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:23,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:23,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:23,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 14:52:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:23,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 14:52:23,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 14:52:23,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:23,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304876787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:23,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:23,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 14:52:23,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119360381] [2021-12-14 14:52:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:23,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 14:52:23,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 14:52:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:52:23,526 INFO L87 Difference]: Start difference. First operand 4462 states and 6000 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) [2021-12-14 14:52:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:23,624 INFO L93 Difference]: Finished difference Result 6829 states and 9325 transitions. [2021-12-14 14:52:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 14:52:23,625 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 [2021-12-14 14:52:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:23,661 INFO L225 Difference]: With dead ends: 6829 [2021-12-14 14:52:23,661 INFO L226 Difference]: Without dead ends: 4496 [2021-12-14 14:52:23,666 INFO L932 BasicCegarLoop]: 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 [2021-12-14 14:52:23,668 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 99 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:23,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 376 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:52:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2021-12-14 14:52:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4438. [2021-12-14 14:52:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4438 states, 3574 states have (on average 1.3102965864577505) internal successors, (4683), 3634 states have internal predecessors, (4683), 479 states have call successors, (479), 336 states have call predecessors, (479), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2021-12-14 14:52:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5882 transitions. [2021-12-14 14:52:23,800 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5882 transitions. Word has length 134 [2021-12-14 14:52:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:23,801 INFO L470 AbstractCegarLoop]: Abstraction has 4438 states and 5882 transitions. [2021-12-14 14:52:23,802 INFO L471 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) [2021-12-14 14:52:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5882 transitions. [2021-12-14 14:52:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-14 14:52:23,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:23,810 INFO L514 BasicCegarLoop]: 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] [2021-12-14 14:52:23,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:24,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:24,024 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:24,024 INFO L85 PathProgramCache]: Analyzing trace with hash -215256625, now seen corresponding path program 1 times [2021-12-14 14:52:24,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:24,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399189555] [2021-12-14 14:52:24,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:24,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 14:52:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 14:52:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 14:52:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-14 14:52:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 14:52:24,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399189555] [2021-12-14 14:52:24,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399189555] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394146430] [2021-12-14 14:52:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:24,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:24,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:24,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:24,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 14:52:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 14:52:24,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 14:52:24,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:24,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394146430] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:24,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:24,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-14 14:52:24,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108046279] [2021-12-14 14:52:24,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:24,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 14:52:24,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 14:52:24,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 14:52:24,349 INFO L87 Difference]: Start difference. First operand 4438 states and 5882 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) [2021-12-14 14:52:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:24,439 INFO L93 Difference]: Finished difference Result 7710 states and 10336 transitions. [2021-12-14 14:52:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 14:52:24,440 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 [2021-12-14 14:52:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:24,453 INFO L225 Difference]: With dead ends: 7710 [2021-12-14 14:52:24,454 INFO L226 Difference]: Without dead ends: 3820 [2021-12-14 14:52:24,498 INFO L932 BasicCegarLoop]: 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 [2021-12-14 14:52:24,499 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:24,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:52:24,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2021-12-14 14:52:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3590. [2021-12-14 14:52:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3590 states, 2892 states have (on average 1.258298755186722) internal successors, (3639), 2936 states have internal predecessors, (3639), 391 states have call successors, (391), 274 states have call predecessors, (391), 306 states have return successors, (510), 387 states have call predecessors, (510), 391 states have call successors, (510) [2021-12-14 14:52:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 4540 transitions. [2021-12-14 14:52:24,616 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 4540 transitions. Word has length 134 [2021-12-14 14:52:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:24,616 INFO L470 AbstractCegarLoop]: Abstraction has 3590 states and 4540 transitions. [2021-12-14 14:52:24,617 INFO L471 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) [2021-12-14 14:52:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4540 transitions. [2021-12-14 14:52:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 14:52:24,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:24,623 INFO L514 BasicCegarLoop]: 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] [2021-12-14 14:52:24,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:24,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 14:52:24,840 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:24,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -564777140, now seen corresponding path program 1 times [2021-12-14 14:52:24,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:24,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243256743] [2021-12-14 14:52:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:24,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 14:52:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 14:52:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 14:52:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 14:52:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 14:52:24,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:24,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243256743] [2021-12-14 14:52:24,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243256743] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:24,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812080872] [2021-12-14 14:52:24,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:24,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:24,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:24,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:24,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 14:52:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:52:25,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 14:52:25,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:25,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812080872] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:25,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:25,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 14:52:25,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597804165] [2021-12-14 14:52:25,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:25,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:52:25,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:25,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:52:25,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 14:52:25,180 INFO L87 Difference]: Start difference. First operand 3590 states and 4540 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) [2021-12-14 14:52:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:25,350 INFO L93 Difference]: Finished difference Result 4996 states and 6377 transitions. [2021-12-14 14:52:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 14:52:25,351 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 [2021-12-14 14:52:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:25,361 INFO L225 Difference]: With dead ends: 4996 [2021-12-14 14:52:25,361 INFO L226 Difference]: Without dead ends: 2670 [2021-12-14 14:52:25,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 14:52:25,368 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 137 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2021-12-14 14:52:25,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 257 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:52:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2021-12-14 14:52:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2658. [2021-12-14 14:52:25,475 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) [2021-12-14 14:52:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3274 transitions. [2021-12-14 14:52:25,482 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3274 transitions. Word has length 135 [2021-12-14 14:52:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:25,482 INFO L470 AbstractCegarLoop]: Abstraction has 2658 states and 3274 transitions. [2021-12-14 14:52:25,483 INFO L471 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) [2021-12-14 14:52:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3274 transitions. [2021-12-14 14:52:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 14:52:25,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:25,487 INFO L514 BasicCegarLoop]: 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] [2021-12-14 14:52:25,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:25,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:25,701 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1871919538, now seen corresponding path program 1 times [2021-12-14 14:52:25,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:25,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460418532] [2021-12-14 14:52:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:25,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 14:52:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 14:52:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 14:52:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 14:52:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 14:52:25,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:25,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460418532] [2021-12-14 14:52:25,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460418532] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:25,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777012296] [2021-12-14 14:52:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:25,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:25,774 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 14:52:25,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 14:52:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:25,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 14:52:25,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 14:52:26,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:26,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777012296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:26,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:26,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-14 14:52:26,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320263325] [2021-12-14 14:52:26,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:26,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:52:26,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:26,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:52:26,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 14:52:26,003 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) [2021-12-14 14:52:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:26,158 INFO L93 Difference]: Finished difference Result 4962 states and 6189 transitions. [2021-12-14 14:52:26,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 14:52:26,158 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 [2021-12-14 14:52:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:26,173 INFO L225 Difference]: With dead ends: 4962 [2021-12-14 14:52:26,173 INFO L226 Difference]: Without dead ends: 2611 [2021-12-14 14:52:26,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-14 14:52:26,180 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 158 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:26,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 266 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 14:52:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2021-12-14 14:52:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1652. [2021-12-14 14:52:26,239 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) [2021-12-14 14:52:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1967 transitions. [2021-12-14 14:52:26,244 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1967 transitions. Word has length 135 [2021-12-14 14:52:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:26,244 INFO L470 AbstractCegarLoop]: Abstraction has 1652 states and 1967 transitions. [2021-12-14 14:52:26,244 INFO L471 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) [2021-12-14 14:52:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1967 transitions. [2021-12-14 14:52:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 14:52:26,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:26,246 INFO L514 BasicCegarLoop]: 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] [2021-12-14 14:52:26,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:26,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:26,459 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash 25577228, now seen corresponding path program 1 times [2021-12-14 14:52:26,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:26,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808728324] [2021-12-14 14:52:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:26,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 14:52:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 14:52:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 14:52:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 14:52:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-14 14:52:26,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:26,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808728324] [2021-12-14 14:52:26,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808728324] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:26,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382038735] [2021-12-14 14:52:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:26,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:26,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:26,560 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) [2021-12-14 14:52:26,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 14:52:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:26,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 14:52:26,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-14 14:52:26,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:26,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382038735] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:26,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:26,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 14:52:26,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897453686] [2021-12-14 14:52:26,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:26,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:52:26,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:26,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:52:26,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 14:52:26,756 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) [2021-12-14 14:52:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:26,841 INFO L93 Difference]: Finished difference Result 2779 states and 3331 transitions. [2021-12-14 14:52:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 14:52:26,842 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 [2021-12-14 14:52:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:26,845 INFO L225 Difference]: With dead ends: 2779 [2021-12-14 14:52:26,845 INFO L226 Difference]: Without dead ends: 1137 [2021-12-14 14:52:26,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 14:52:26,849 INFO L933 BasicCegarLoop]: 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 [2021-12-14 14:52:26,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 537 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:52:26,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2021-12-14 14:52:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1101. [2021-12-14 14:52:26,886 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) [2021-12-14 14:52:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1274 transitions. [2021-12-14 14:52:26,889 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1274 transitions. Word has length 135 [2021-12-14 14:52:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:26,889 INFO L470 AbstractCegarLoop]: Abstraction has 1101 states and 1274 transitions. [2021-12-14 14:52:26,889 INFO L471 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) [2021-12-14 14:52:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1274 transitions. [2021-12-14 14:52:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 14:52:26,891 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:26,891 INFO L514 BasicCegarLoop]: 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] [2021-12-14 14:52:26,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:27,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 14:52:27,108 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:27,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash 537608328, now seen corresponding path program 1 times [2021-12-14 14:52:27,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:27,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024695979] [2021-12-14 14:52:27,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:27,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 14:52:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 14:52:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 14:52:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 14:52:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-14 14:52:27,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:27,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024695979] [2021-12-14 14:52:27,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024695979] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 14:52:27,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138349142] [2021-12-14 14:52:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:27,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 14:52:27,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 14:52:27,190 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) [2021-12-14 14:52:27,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 14:52:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 14:52:27,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 14:52:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-14 14:52:27,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 14:52:27,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138349142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:27,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 14:52:27,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-14 14:52:27,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367724735] [2021-12-14 14:52:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:27,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 14:52:27,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:27,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 14:52:27,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 14:52:27,386 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) [2021-12-14 14:52:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:27,439 INFO L93 Difference]: Finished difference Result 2220 states and 2613 transitions. [2021-12-14 14:52:27,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 14:52:27,440 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 [2021-12-14 14:52:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:27,442 INFO L225 Difference]: With dead ends: 2220 [2021-12-14 14:52:27,442 INFO L226 Difference]: Without dead ends: 1129 [2021-12-14 14:52:27,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 14:52:27,445 INFO L933 BasicCegarLoop]: 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 [2021-12-14 14:52:27,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 523 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 14:52:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-12-14 14:52:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1113. [2021-12-14 14:52:27,484 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) [2021-12-14 14:52:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1265 transitions. [2021-12-14 14:52:27,486 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1265 transitions. Word has length 135 [2021-12-14 14:52:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:27,486 INFO L470 AbstractCegarLoop]: Abstraction has 1113 states and 1265 transitions. [2021-12-14 14:52:27,486 INFO L471 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) [2021-12-14 14:52:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1265 transitions. [2021-12-14 14:52:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-14 14:52:27,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:27,488 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:27,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 14:52:27,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 14:52:27,702 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:27,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash -219686780, now seen corresponding path program 1 times [2021-12-14 14:52:27,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:27,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538746041] [2021-12-14 14:52:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:27,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 14:52:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 14:52:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 14:52:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 14:52:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-14 14:52:27,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:27,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538746041] [2021-12-14 14:52:27,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538746041] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:27,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:27,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 14:52:27,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286875534] [2021-12-14 14:52:27,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:27,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 14:52:27,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:27,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 14:52:27,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 14:52:27,788 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) [2021-12-14 14:52:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:28,160 INFO L93 Difference]: Finished difference Result 2070 states and 2337 transitions. [2021-12-14 14:52:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 14:52:28,160 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 [2021-12-14 14:52:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:28,166 INFO L225 Difference]: With dead ends: 2070 [2021-12-14 14:52:28,166 INFO L226 Difference]: Without dead ends: 2068 [2021-12-14 14:52:28,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-14 14:52:28,167 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 470 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:28,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 492 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 14:52:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2021-12-14 14:52:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1489. [2021-12-14 14:52:28,232 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) [2021-12-14 14:52:28,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1693 transitions. [2021-12-14 14:52:28,235 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1693 transitions. Word has length 135 [2021-12-14 14:52:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:28,235 INFO L470 AbstractCegarLoop]: Abstraction has 1489 states and 1693 transitions. [2021-12-14 14:52:28,235 INFO L471 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) [2021-12-14 14:52:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1693 transitions. [2021-12-14 14:52:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-14 14:52:28,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 14:52:28,238 INFO L514 BasicCegarLoop]: 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] [2021-12-14 14:52:28,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 14:52:28,238 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 14:52:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 14:52:28,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1479334343, now seen corresponding path program 2 times [2021-12-14 14:52:28,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 14:52:28,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307133457] [2021-12-14 14:52:28,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 14:52:28,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 14:52:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 14:52:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 14:52:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 14:52:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 14:52:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 14:52:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 14:52:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-14 14:52:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 14:52:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-14 14:52:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-14 14:52:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-14 14:52:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-14 14:52:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 14:52:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-12-14 14:52:28,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 14:52:28,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307133457] [2021-12-14 14:52:28,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307133457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 14:52:28,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 14:52:28,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 14:52:28,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133836349] [2021-12-14 14:52:28,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 14:52:28,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 14:52:28,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 14:52:28,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 14:52:28,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 14:52:28,324 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) [2021-12-14 14:52:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 14:52:28,762 INFO L93 Difference]: Finished difference Result 3212 states and 3666 transitions. [2021-12-14 14:52:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 14:52:28,762 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 [2021-12-14 14:52:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 14:52:28,763 INFO L225 Difference]: With dead ends: 3212 [2021-12-14 14:52:28,763 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 14:52:28,768 INFO L932 BasicCegarLoop]: 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 [2021-12-14 14:52:28,768 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 582 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 14:52:28,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 422 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 14:52:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 14:52:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 14:52:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 14:52:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 14:52:28,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2021-12-14 14:52:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 14:52:28,770 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 14:52:28,770 INFO L471 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) [2021-12-14 14:52:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 14:52:28,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 14:52:28,772 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 14:52:28,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 14:52:28,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 14:52:40,894 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2021-12-14 14:52:40,894 INFO L854 garLoopResultBuilder]: At program point L155(lines 139 157) the Hoare annotation is: (let ((.cse19 (<= |activate_threads_is_transmit1_triggered_#res#1| 0)) (.cse21 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse22 (<= 0 |activate_threads_is_transmit1_triggered_#res#1|)) (.cse23 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse24 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse25 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse20 (<= |activate_threads_~tmp~1#1| 0)) (.cse27 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse5 (and .cse24 .cse25 .cse16 .cse17 .cse18 .cse26 .cse20 .cse27)) (.cse9 (and .cse24 .cse25 .cse17 (<= 2 ~m_st~0) .cse26 .cse20 .cse27)) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse14 (not (< ~local~0 ~token~0))) (.cse15 (not (<= ~token~0 (+ ~local~0 1)))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~m_pc~0 0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~t1_st~0)| 0)) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 1 ~m_pc~0))) (.cse13 (and .cse24 .cse25 .cse16 .cse17 .cse18 .cse26 .cse19 .cse20 .cse21 .cse27 .cse22 .cse23)) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse1 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (or .cse7 .cse0 .cse11 .cse8 .cse3 .cse9 .cse10) (or .cse0 .cse1 .cse8 .cse2 .cse3 .cse12 .cse13 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse12 .cse13 .cse10 .cse15) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and (= ~m_st~0 0) .cse19 .cse21 (not (= ~t1_st~0 0)) .cse22 .cse23) .cse7 .cse0 .cse1 .cse2 .cse14 .cse4 .cse10 .cse15) (or .cse7 .cse0 .cse11 .cse3 .cse4 .cse13 .cse10 .cse6) (or .cse7 .cse0 .cse1 .cse3 .cse4 .cse13 .cse10 .cse6) (or .cse0 .cse11 .cse8 .cse3 .cse13 .cse6) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse10)))) [2021-12-14 14:52:40,894 INFO L858 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2021-12-14 14:52:40,894 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2021-12-14 14:52:40,895 INFO L858 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2021-12-14 14:52:40,895 INFO L854 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (let ((.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse8 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse11 (not (= |old(~m_st~0)| 0))) (.cse3 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~m_pc~0 0))) (.cse4 (and .cse14 .cse15 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse5 (not (<= 1 ~m_pc~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse13 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 .cse9 .cse3 .cse4 .cse10) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse6) (or .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse11 .cse10) (or .cse7 .cse0 .cse1 .cse3 .cse4 .cse5 .cse10 .cse6) (or .cse7 .cse0 .cse8 .cse3 .cse4 .cse5 .cse10 .cse6) (or .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse11 .cse10 .cse13) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10) (or .cse7 .cse0 .cse1 .cse9 .cse4 .cse10) (or .cse7 .cse0 (and .cse14 .cse15) .cse1 .cse2 .cse12 .cse5 .cse10 .cse13)))) [2021-12-14 14:52:40,895 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-12-14 14:52:40,895 INFO L858 garLoopResultBuilder]: For program point L327-2(lines 311 335) no Hoare annotation was computed. [2021-12-14 14:52:40,895 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2021-12-14 14:52:40,895 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2021-12-14 14:52:40,895 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 319 323) no Hoare annotation was computed. [2021-12-14 14:52:40,896 INFO L854 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (let ((.cse20 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse21 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse22 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse23 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse24 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse19 (<= |activate_threads_~tmp~1#1| 0)) (.cse25 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse5 (and .cse22 .cse23 .cse16 .cse17 .cse18 .cse24 .cse19 .cse25)) (.cse13 (not (<= ~t1_pc~0 0))) (.cse15 (and .cse22 .cse23 .cse17 (<= 2 ~m_st~0) .cse24 .cse19 .cse25)) (.cse8 (not (< ~local~0 ~token~0))) (.cse11 (not (<= ~token~0 (+ ~local~0 1)))) (.cse14 (not (= ~m_pc~0 0))) (.cse9 (not (= |old(~m_st~0)| 0))) (.cse2 (= |old(~t1_st~0)| 0)) (.cse7 (and .cse22 .cse23 .cse16 .cse17 .cse18 .cse24 .cse19 .cse20 .cse25 .cse21)) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 ~E_M~0))) (.cse4 (not (<= 1 ~m_pc~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse6 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse10 .cse11) (or .cse7 .cse12 .cse0 .cse13 .cse3 .cse4 .cse10 .cse6) (or .cse12 .cse0 .cse1 .cse14 .cse15 .cse10) (or .cse7 .cse0 .cse13 .cse14 .cse3 .cse6) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse5 .cse6) (or .cse12 .cse0 .cse13 .cse14 .cse3 .cse15 .cse10) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse12 .cse0 .cse1 .cse2 .cse8 .cse4 (and (= ~m_st~0 0) .cse20 (not (= ~t1_st~0 0)) .cse21) .cse10 .cse11) (or .cse7 .cse0 .cse1 .cse14 .cse2 .cse3 .cse9 .cse10) (or .cse7 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10) (or .cse7 .cse12 .cse0 .cse1 .cse3 .cse4 .cse10 .cse6)))) [2021-12-14 14:52:40,896 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-12-14 14:52:40,896 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 311 335) the Hoare annotation is: (let ((.cse12 (not (= |old(~m_st~0)| 0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse10 (not (= ~m_pc~0 0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (< ~local~0 ~token~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse13 (not (<= ~token~0 (+ ~local~0 1)))) (.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)) (.cse4 (not (<= 2 ~E_M~0))) (.cse5 (not (<= 1 ~m_pc~0))) (.cse7 (not (= ~token~0 ~local~0)))) (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 .cse3 .cse10 .cse4 .cse7) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse11 .cse5 .cse12 .cse6 .cse13) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse7) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse12 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse6) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse11 .cse5 .cse6 .cse13) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse7))) [2021-12-14 14:52:40,896 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 311 335) no Hoare annotation was computed. [2021-12-14 14:52:40,896 INFO L854 garLoopResultBuilder]: At program point L136(lines 120 138) the Hoare annotation is: (let ((.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse5 (not (= |old(~m_st~0)| 0))) (.cse11 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse10 (not (<= 1 ~m_pc~0))) (.cse13 (not (<= ~token~0 (+ ~local~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse9 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse7 (and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_#res#1| 0) .cse14 .cse15 (<= 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 .cse7) (or .cse8 .cse0 .cse9 .cse4 .cse10 .cse6 .cse11 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse12 .cse10 .cse5 .cse6 .cse13 .cse7) (or .cse0 .cse1 .cse3 .cse4 .cse10 .cse11 .cse7) (or .cse8 .cse0 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7) (or .cse8 .cse0 .cse1 .cse4 .cse10 .cse6 .cse11 .cse7) (or .cse0 .cse9 .cse2 .cse4 .cse11 .cse7) (or .cse8 .cse0 .cse1 .cse2 .cse6 .cse7) (or .cse8 .cse0 (and .cse14 .cse15) .cse1 .cse3 .cse12 .cse10 .cse6 .cse13) (or .cse8 .cse0 .cse9 .cse2 .cse4 .cse6 .cse7)))) [2021-12-14 14:52:40,896 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 336 346) no Hoare annotation was computed. [2021-12-14 14:52:40,897 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 336 346) the Hoare annotation is: (let ((.cse4 (not (= ~m_pc~0 0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 ~E_1~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))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse6 (not (<= 2 ~E_M~0))) (.cse9 (not (<= 1 ~m_pc~0))) (.cse7 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse2 (not (<= ~t1_pc~0 0)) .cse4 .cse6 .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse8 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse8 (not (< ~local~0 ~token~0)) .cse9 .cse5 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse1 .cse2 .cse3 .cse8 .cse6 .cse9 .cse7))) [2021-12-14 14:52:40,897 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 336 346) no Hoare annotation was computed. [2021-12-14 14:52:40,897 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 197) no Hoare annotation was computed. [2021-12-14 14:52:40,897 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 184 203) no Hoare annotation was computed. [2021-12-14 14:52:40,897 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 198) no Hoare annotation was computed. [2021-12-14 14:52:40,897 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 184 203) the Hoare annotation is: true [2021-12-14 14:52:40,897 INFO L861 garLoopResultBuilder]: At program point L200(lines 187 202) the Hoare annotation is: true [2021-12-14 14:52:40,897 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 184 203) no Hoare annotation was computed. [2021-12-14 14:52:40,898 INFO L854 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))) [2021-12-14 14:52:40,898 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 255 282) no Hoare annotation was computed. [2021-12-14 14:52:40,898 INFO L858 garLoopResultBuilder]: For program point L274-1(lines 255 282) no Hoare annotation was computed. [2021-12-14 14:52:40,898 INFO L858 garLoopResultBuilder]: For program point L269-1(lines 258 281) no Hoare annotation was computed. [2021-12-14 14:52:40,898 INFO L858 garLoopResultBuilder]: For program point L264-1(lines 258 281) no Hoare annotation was computed. [2021-12-14 14:52:40,898 INFO L858 garLoopResultBuilder]: For program point L259-1(lines 258 281) no Hoare annotation was computed. [2021-12-14 14:52:40,898 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 158 165) no Hoare annotation was computed. [2021-12-14 14:52:40,898 INFO L861 garLoopResultBuilder]: At program point update_channelsFINAL(lines 158 165) the Hoare annotation is: true [2021-12-14 14:52:40,898 INFO L858 garLoopResultBuilder]: For program point L287-1(lines 286 309) no Hoare annotation was computed. [2021-12-14 14:52:40,899 INFO L854 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))) [2021-12-14 14:52:40,899 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 283 310) no Hoare annotation was computed. [2021-12-14 14:52:40,899 INFO L858 garLoopResultBuilder]: For program point L302-1(lines 283 310) no Hoare annotation was computed. [2021-12-14 14:52:40,899 INFO L858 garLoopResultBuilder]: For program point L297-1(lines 286 309) no Hoare annotation was computed. [2021-12-14 14:52:40,899 INFO L858 garLoopResultBuilder]: For program point L292-1(lines 286 309) no Hoare annotation was computed. [2021-12-14 14:52:40,899 INFO L861 garLoopResultBuilder]: At program point L481(lines 472 483) the Hoare annotation is: true [2021-12-14 14:52:40,899 INFO L854 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))) [2021-12-14 14:52:40,900 INFO L854 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))) [2021-12-14 14:52:40,900 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 14:52:40,900 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-12-14 14:52:40,900 INFO L861 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: true [2021-12-14 14:52:40,900 INFO L854 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))) [2021-12-14 14:52:40,900 INFO L858 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2021-12-14 14:52:40,900 INFO L854 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2021-12-14 14:52:40,900 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 174) no Hoare annotation was computed. [2021-12-14 14:52:40,900 INFO L858 garLoopResultBuilder]: For program point L170-2(lines 169 182) no Hoare annotation was computed. [2021-12-14 14:52:40,901 INFO L854 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))) [2021-12-14 14:52:40,901 INFO L858 garLoopResultBuilder]: For program point L451-1(line 451) no Hoare annotation was computed. [2021-12-14 14:52:40,901 INFO L858 garLoopResultBuilder]: For program point L220(lines 210 248) no Hoare annotation was computed. [2021-12-14 14:52:40,901 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2021-12-14 14:52:40,901 INFO L858 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2021-12-14 14:52:40,901 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2021-12-14 14:52:40,901 INFO L854 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))) [2021-12-14 14:52:40,901 INFO L858 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2021-12-14 14:52:40,902 INFO L854 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))) [2021-12-14 14:52:40,902 INFO L858 garLoopResultBuilder]: For program point L436-1(line 436) no Hoare annotation was computed. [2021-12-14 14:52:40,902 INFO L858 garLoopResultBuilder]: For program point L370-1(lines 359 382) no Hoare annotation was computed. [2021-12-14 14:52:40,902 INFO L854 garLoopResultBuilder]: At program point L421(line 421) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~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)) [2021-12-14 14:52:40,902 INFO L858 garLoopResultBuilder]: For program point L421-1(line 421) no Hoare annotation was computed. [2021-12-14 14:52:40,902 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 14:52:40,902 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2021-12-14 14:52:40,902 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-12-14 14:52:40,903 INFO L854 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)))) [2021-12-14 14:52:40,903 INFO L854 garLoopResultBuilder]: At program point L175-1(lines 166 183) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~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))) [2021-12-14 14:52:40,903 INFO L854 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)))) [2021-12-14 14:52:40,903 INFO L858 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2021-12-14 14:52:40,903 INFO L854 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~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))) [2021-12-14 14:52:40,903 INFO L854 garLoopResultBuilder]: At program point L423-1(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~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))) [2021-12-14 14:52:40,903 INFO L854 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))) [2021-12-14 14:52:40,904 INFO L854 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))) [2021-12-14 14:52:40,904 INFO L854 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))) [2021-12-14 14:52:40,904 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-12-14 14:52:40,904 INFO L854 garLoopResultBuilder]: At program point L424(line 424) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~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))) [2021-12-14 14:52:40,904 INFO L854 garLoopResultBuilder]: At program point L391(lines 384 393) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~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)) [2021-12-14 14:52:40,904 INFO L854 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (not (= ~t1_st~0 0))) (.cse5 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 .cse5) (and .cse0 .cse1 (<= 1 ~m_pc~0) .cse2 .cse4 .cse5))) [2021-12-14 14:52:40,904 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 14:52:40,904 INFO L858 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2021-12-14 14:52:40,905 INFO L854 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))) [2021-12-14 14:52:40,905 INFO L854 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))) [2021-12-14 14:52:40,905 INFO L854 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))) [2021-12-14 14:52:40,905 INFO L854 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))) [2021-12-14 14:52:40,905 INFO L854 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))) [2021-12-14 14:52:40,905 INFO L858 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2021-12-14 14:52:40,905 INFO L858 garLoopResultBuilder]: For program point L360-2(lines 359 382) no Hoare annotation was computed. [2021-12-14 14:52:40,906 INFO L854 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))) [2021-12-14 14:52:40,906 INFO L854 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))) [2021-12-14 14:52:40,906 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2021-12-14 14:52:40,906 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2021-12-14 14:52:40,906 INFO L858 garLoopResultBuilder]: For program point L213(line 213) no Hoare annotation was computed. [2021-12-14 14:52:40,906 INFO L854 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)) [2021-12-14 14:52:40,906 INFO L854 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))) [2021-12-14 14:52:40,907 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 14:52:40,907 INFO L858 garLoopResultBuilder]: For program point L445(line 445) no Hoare annotation was computed. [2021-12-14 14:52:40,907 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-12-14 14:52:40,910 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2021-12-14 14:52:40,911 INFO L854 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)))) [2021-12-14 14:52:40,911 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2021-12-14 14:52:40,911 INFO L858 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2021-12-14 14:52:40,911 INFO L858 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2021-12-14 14:52:40,911 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 456) no Hoare annotation was computed. [2021-12-14 14:52:40,911 INFO L858 garLoopResultBuilder]: For program point L447-2(lines 447 456) no Hoare annotation was computed. [2021-12-14 14:52:40,911 INFO L854 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))) [2021-12-14 14:52:40,911 INFO L858 garLoopResultBuilder]: For program point L365-1(lines 359 382) no Hoare annotation was computed. [2021-12-14 14:52:40,914 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 14:52:40,915 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 14:52:40,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 02:52:40 BoogieIcfgContainer [2021-12-14 14:52:40,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 14:52:40,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 14:52:40,979 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 14:52:40,980 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 14:52:40,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:52:17" (3/4) ... [2021-12-14 14:52:40,983 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 14:52:40,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-12-14 14:52:40,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-14 14:52:40,988 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-12-14 14:52:40,988 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-12-14 14:52:40,988 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-12-14 14:52:40,988 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-12-14 14:52:40,998 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-12-14 14:52:40,998 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-14 14:52:40,999 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 14:52:40,999 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 14:52:41,018 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(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)) || !(token == local)) && ((((((!(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)) || !(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)) || !(\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 <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(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 <= \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)) [2021-12-14 14:52:41,018 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)) || !(\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)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(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 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(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)) || \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 <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(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)) [2021-12-14 14:52:41,020 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(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) && 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 <= 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) && 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))) && ((((((((((((((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)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((((((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 <= 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 <= \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)) [2021-12-14 14:52:41,020 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(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) && 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 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((((((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 <= 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 <= 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)) || !(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)) [2021-12-14 14:52:41,053 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 14:52:41,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 14:52:41,054 INFO L158 Benchmark]: Toolchain (without parser) took 24184.96ms. Allocated memory was 98.6MB in the beginning and 740.3MB in the end (delta: 641.7MB). Free memory was 68.8MB in the beginning and 333.8MB in the end (delta: -265.0MB). Peak memory consumption was 376.5MB. Max. memory is 16.1GB. [2021-12-14 14:52:41,054 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 98.6MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 14:52:41,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.53ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 68.8MB in the beginning and 96.3MB in the end (delta: -27.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 14:52:41,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.98ms. Allocated memory is still 121.6MB. Free memory was 95.7MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 14:52:41,055 INFO L158 Benchmark]: Boogie Preprocessor took 44.94ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 92.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 14:52:41,056 INFO L158 Benchmark]: RCFGBuilder took 314.32ms. Allocated memory is still 121.6MB. Free memory was 92.7MB in the beginning and 77.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-14 14:52:41,056 INFO L158 Benchmark]: TraceAbstraction took 23490.54ms. Allocated memory was 121.6MB in the beginning and 740.3MB in the end (delta: 618.7MB). Free memory was 76.6MB in the beginning and 341.2MB in the end (delta: -264.6MB). Peak memory consumption was 383.4MB. Max. memory is 16.1GB. [2021-12-14 14:52:41,056 INFO L158 Benchmark]: Witness Printer took 74.06ms. Allocated memory is still 740.3MB. Free memory was 341.2MB in the beginning and 333.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 14:52:41,059 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 98.6MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.53ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 68.8MB in the beginning and 96.3MB in the end (delta: -27.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.98ms. Allocated memory is still 121.6MB. Free memory was 95.7MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.94ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 92.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.32ms. Allocated memory is still 121.6MB. Free memory was 92.7MB in the beginning and 77.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23490.54ms. Allocated memory was 121.6MB in the beginning and 740.3MB in the end (delta: 618.7MB). Free memory was 76.6MB in the beginning and 341.2MB in the end (delta: -264.6MB). Peak memory consumption was 383.4MB. Max. memory is 16.1GB. * Witness Printer took 74.06ms. Allocated memory is still 740.3MB. Free memory was 341.2MB in the beginning and 333.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.4s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3566 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3456 mSDsluCounter, 7128 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4223 mSDsCounter, 642 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3685 IncrementalHoareTripleChecker+Invalid, 4327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 642 mSolverCounterUnsat, 2905 mSDtfsCounter, 3685 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1611 GetRequests, 1455 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4462occurred in iteration=8, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 2654 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 6049 PreInvPairs, 6764 NumberOfFragments, 6912 HoareAnnotationTreeSize, 6049 FomulaSimplifications, 5310 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 43 FomulaSimplificationsInter, 438881 FormulaSimplificationTreeSizeReductionInter, 9.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2887 NumberOfCodeBlocks, 2887 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2862 ConstructedInterpolants, 0 QuantifiedInterpolants, 4637 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 == 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)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(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 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(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)) || \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 <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(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 && E_1 == M_E) && 2 <= m_st) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && E_1 == M_E) && 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: (((((((((((((((!(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) && 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 <= 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) && 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))) && ((((((((((((((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)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((((((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 <= 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 <= \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)) - 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)) || \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) && 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 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((((((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 <= 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 <= 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)) || !(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)) - 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 <= 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)) || !(token == local)) && ((((((!(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)) || !(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)) || !(\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 <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(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 <= \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 && E_1 == M_E) && 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! [2021-12-14 14:52:41,110 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