./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/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-tmp.no-commuhash-c3fed41 [2021-12-17 15:35:10,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 15:35:10,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 15:35:10,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 15:35:10,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 15:35:10,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 15:35:10,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 15:35:10,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 15:35:10,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 15:35:10,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 15:35:10,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 15:35:10,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 15:35:10,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 15:35:10,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 15:35:10,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 15:35:10,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 15:35:10,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 15:35:10,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 15:35:10,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 15:35:10,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 15:35:10,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 15:35:10,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 15:35:10,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 15:35:10,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 15:35:10,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 15:35:10,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 15:35:10,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 15:35:10,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 15:35:10,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 15:35:10,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 15:35:10,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 15:35:10,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 15:35:10,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 15:35:10,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 15:35:10,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 15:35:10,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 15:35:10,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 15:35:10,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 15:35:10,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 15:35:10,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 15:35:10,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 15:35:10,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 15:35:10,509 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 15:35:10,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 15:35:10,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 15:35:10,510 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 15:35:10,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 15:35:10,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 15:35:10,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 15:35:10,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 15:35:10,512 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 15:35:10,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 15:35:10,513 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 15:35:10,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 15:35:10,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 15:35:10,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 15:35:10,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 15:35:10,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 15:35:10,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 15:35:10,514 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 15:35:10,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 15:35:10,514 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 15:35:10,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 15:35:10,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 15:35:10,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 15:35:10,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 15:35:10,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:35:10,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 15:35:10,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 15:35:10,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 15:35:10,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 15:35:10,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 15:35:10,516 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 15:35:10,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 15:35:10,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 15:35:10,516 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 15:35:10,516 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-17 15:35:10,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 15:35:10,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 15:35:10,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 15:35:10,757 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 15:35:10,758 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 15:35:10,759 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-17 15:35:10,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becee5ff2/91c5ac25dc314f0c84c64fb4eebc394e/FLAG3f07b8a25 [2021-12-17 15:35:11,192 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 15:35:11,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-12-17 15:35:11,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becee5ff2/91c5ac25dc314f0c84c64fb4eebc394e/FLAG3f07b8a25 [2021-12-17 15:35:11,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becee5ff2/91c5ac25dc314f0c84c64fb4eebc394e [2021-12-17 15:35:11,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 15:35:11,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 15:35:11,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 15:35:11,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 15:35:11,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 15:35:11,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dc5775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11, skipping insertion in model container [2021-12-17 15:35:11,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 15:35:11,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 15:35:11,380 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-17 15:35:11,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:35:11,440 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 15:35:11,449 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-17 15:35:11,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 15:35:11,489 INFO L208 MainTranslator]: Completed translation [2021-12-17 15:35:11,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11 WrapperNode [2021-12-17 15:35:11,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 15:35:11,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 15:35:11,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 15:35:11,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 15:35:11,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,526 INFO L137 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 215 [2021-12-17 15:35:11,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 15:35:11,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 15:35:11,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 15:35:11,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 15:35:11,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 15:35:11,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 15:35:11,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 15:35:11,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 15:35:11,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (1/1) ... [2021-12-17 15:35:11,569 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 15:35:11,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:11,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 15:35:11,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 15:35:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 15:35:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-17 15:35:11,621 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-17 15:35:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-17 15:35:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-17 15:35:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-17 15:35:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-17 15:35:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-17 15:35:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-17 15:35:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-17 15:35:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-17 15:35:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 15:35:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-17 15:35:11,623 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-17 15:35:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 15:35:11,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 15:35:11,669 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 15:35:11,670 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 15:35:11,831 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 15:35:11,836 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 15:35:11,848 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 15:35:11,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:35:11 BoogieIcfgContainer [2021-12-17 15:35:11,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 15:35:11,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 15:35:11,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 15:35:11,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 15:35:11,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 03:35:11" (1/3) ... [2021-12-17 15:35:11,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a52715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:35:11, skipping insertion in model container [2021-12-17 15:35:11,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 03:35:11" (2/3) ... [2021-12-17 15:35:11,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a52715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 03:35:11, skipping insertion in model container [2021-12-17 15:35:11,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:35:11" (3/3) ... [2021-12-17 15:35:11,868 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-12-17 15:35:11,871 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 15:35:11,872 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 15:35:11,915 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 15:35:11,921 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 15:35:11,921 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 15:35:11,946 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-17 15:35:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-17 15:35:11,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:11,954 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-17 15:35:11,955 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1624964503, now seen corresponding path program 1 times [2021-12-17 15:35:11,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:11,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978904770] [2021-12-17 15:35:11,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:11,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:12,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:12,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:12,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:12,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:12,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978904770] [2021-12-17 15:35:12,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978904770] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:12,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:12,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:35:12,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65089498] [2021-12-17 15:35:12,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:12,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:35:12,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:12,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:35:12,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:35:12,256 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-17 15:35:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:12,800 INFO L93 Difference]: Finished difference Result 339 states and 511 transitions. [2021-12-17 15:35:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:35:12,802 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-17 15:35:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:12,819 INFO L225 Difference]: With dead ends: 339 [2021-12-17 15:35:12,819 INFO L226 Difference]: Without dead ends: 233 [2021-12-17 15:35:12,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-17 15:35:12,824 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-17 15:35:12,825 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-17 15:35:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-17 15:35:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2021-12-17 15:35:12,882 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-17 15:35:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 272 transitions. [2021-12-17 15:35:12,887 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 272 transitions. Word has length 56 [2021-12-17 15:35:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:12,888 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 272 transitions. [2021-12-17 15:35:12,888 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-17 15:35:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 272 transitions. [2021-12-17 15:35:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-17 15:35:12,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:12,894 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-17 15:35:12,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 15:35:12,895 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:12,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:12,898 INFO L85 PathProgramCache]: Analyzing trace with hash 713012507, now seen corresponding path program 1 times [2021-12-17 15:35:12,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:12,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274975954] [2021-12-17 15:35:12,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:12,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:12,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:13,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:13,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274975954] [2021-12-17 15:35:13,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274975954] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:13,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:13,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:35:13,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63581999] [2021-12-17 15:35:13,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:13,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:35:13,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:13,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:35:13,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:35:13,053 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-17 15:35:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:13,552 INFO L93 Difference]: Finished difference Result 524 states and 746 transitions. [2021-12-17 15:35:13,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 15:35:13,552 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-17 15:35:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:13,555 INFO L225 Difference]: With dead ends: 524 [2021-12-17 15:35:13,555 INFO L226 Difference]: Without dead ends: 341 [2021-12-17 15:35:13,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-17 15:35:13,564 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-17 15:35:13,565 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-17 15:35:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-17 15:35:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 277. [2021-12-17 15:35:13,598 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-17 15:35:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 389 transitions. [2021-12-17 15:35:13,599 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 389 transitions. Word has length 56 [2021-12-17 15:35:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:13,600 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 389 transitions. [2021-12-17 15:35:13,600 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-17 15:35:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 389 transitions. [2021-12-17 15:35:13,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-17 15:35:13,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:13,601 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-17 15:35:13,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 15:35:13,601 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:13,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1336375335, now seen corresponding path program 1 times [2021-12-17 15:35:13,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:13,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632269201] [2021-12-17 15:35:13,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:13,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:13,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:13,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632269201] [2021-12-17 15:35:13,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632269201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:13,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:13,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:35:13,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905544553] [2021-12-17 15:35:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:13,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:35:13,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:13,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:35:13,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:35:13,657 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-17 15:35:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:14,095 INFO L93 Difference]: Finished difference Result 860 states and 1213 transitions. [2021-12-17 15:35:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 15:35:14,096 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-17 15:35:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:14,099 INFO L225 Difference]: With dead ends: 860 [2021-12-17 15:35:14,099 INFO L226 Difference]: Without dead ends: 592 [2021-12-17 15:35:14,100 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-17 15:35:14,101 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.3s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:14,101 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.3s Time] [2021-12-17 15:35:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-12-17 15:35:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 442. [2021-12-17 15:35:14,118 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-17 15:35:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 620 transitions. [2021-12-17 15:35:14,121 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 620 transitions. Word has length 56 [2021-12-17 15:35:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:14,121 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 620 transitions. [2021-12-17 15:35:14,121 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-17 15:35:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 620 transitions. [2021-12-17 15:35:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-17 15:35:14,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:14,123 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-17 15:35:14,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 15:35:14,123 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2061198683, now seen corresponding path program 1 times [2021-12-17 15:35:14,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:14,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122302166] [2021-12-17 15:35:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:14,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:14,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:14,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122302166] [2021-12-17 15:35:14,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122302166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:14,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:14,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 15:35:14,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4774344] [2021-12-17 15:35:14,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:14,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 15:35:14,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:14,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 15:35:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:35:14,237 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-17 15:35:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:14,709 INFO L93 Difference]: Finished difference Result 1382 states and 1944 transitions. [2021-12-17 15:35:14,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 15:35:14,709 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-17 15:35:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:14,715 INFO L225 Difference]: With dead ends: 1382 [2021-12-17 15:35:14,715 INFO L226 Difference]: Without dead ends: 949 [2021-12-17 15:35:14,716 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-17 15:35:14,725 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-17 15:35:14,726 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-17 15:35:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-12-17 15:35:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 741. [2021-12-17 15:35:14,768 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-17 15:35:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1042 transitions. [2021-12-17 15:35:14,774 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1042 transitions. Word has length 56 [2021-12-17 15:35:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:14,775 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 1042 transitions. [2021-12-17 15:35:14,775 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-17 15:35:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1042 transitions. [2021-12-17 15:35:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-17 15:35:14,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:14,785 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-17 15:35:14,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 15:35:14,786 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1985622119, now seen corresponding path program 1 times [2021-12-17 15:35:14,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:14,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024017602] [2021-12-17 15:35:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:14,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 15:35:14,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:14,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024017602] [2021-12-17 15:35:14,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024017602] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:14,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:14,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:35:14,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453399655] [2021-12-17 15:35:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:14,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:35:14,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:35:14,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:35:14,846 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-17 15:35:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:15,189 INFO L93 Difference]: Finished difference Result 2078 states and 2936 transitions. [2021-12-17 15:35:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 15:35:15,189 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-17 15:35:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:15,195 INFO L225 Difference]: With dead ends: 2078 [2021-12-17 15:35:15,195 INFO L226 Difference]: Without dead ends: 1347 [2021-12-17 15:35:15,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-17 15:35:15,197 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.2s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:15,198 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.2s Time] [2021-12-17 15:35:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2021-12-17 15:35:15,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1142. [2021-12-17 15:35:15,244 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-17 15:35:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1576 transitions. [2021-12-17 15:35:15,249 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1576 transitions. Word has length 56 [2021-12-17 15:35:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:15,250 INFO L470 AbstractCegarLoop]: Abstraction has 1142 states and 1576 transitions. [2021-12-17 15:35:15,250 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-17 15:35:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1576 transitions. [2021-12-17 15:35:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-17 15:35:15,281 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:15,281 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-17 15:35:15,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 15:35:15,282 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash -34790867, now seen corresponding path program 1 times [2021-12-17 15:35:15,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:15,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261087294] [2021-12-17 15:35:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:15,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 15:35:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-17 15:35:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,391 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-17 15:35:15,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:15,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261087294] [2021-12-17 15:35:15,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261087294] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:15,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259713794] [2021-12-17 15:35:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:15,392 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:15,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:35:15,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 15:35:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:15,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:35:15,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:15,667 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-17 15:35:15,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:15,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259713794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:15,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:15,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:35:15,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498410163] [2021-12-17 15:35:15,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:15,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:35:15,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:15,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:35:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:35:15,673 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-17 15:35:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:15,748 INFO L93 Difference]: Finished difference Result 3321 states and 4650 transitions. [2021-12-17 15:35:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:35:15,749 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-17 15:35:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:15,757 INFO L225 Difference]: With dead ends: 3321 [2021-12-17 15:35:15,757 INFO L226 Difference]: Without dead ends: 2190 [2021-12-17 15:35:15,760 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-17 15:35:15,760 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-17 15:35:15,761 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-17 15:35:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2021-12-17 15:35:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2190. [2021-12-17 15:35:15,847 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-17 15:35:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 3028 transitions. [2021-12-17 15:35:15,855 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 3028 transitions. Word has length 91 [2021-12-17 15:35:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:15,855 INFO L470 AbstractCegarLoop]: Abstraction has 2190 states and 3028 transitions. [2021-12-17 15:35:15,856 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-17 15:35:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 3028 transitions. [2021-12-17 15:35:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-17 15:35:15,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:15,860 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-17 15:35:15,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 15:35:16,075 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-17 15:35:16,076 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:16,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1902655295, now seen corresponding path program 1 times [2021-12-17 15:35:16,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:16,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413985926] [2021-12-17 15:35:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:16,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-17 15:35:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-17 15:35:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-17 15:35:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,179 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-17 15:35:16,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:16,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413985926] [2021-12-17 15:35:16,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413985926] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:16,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625939633] [2021-12-17 15:35:16,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:16,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:16,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:16,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:35:16,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 15:35:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:35:16,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:16,417 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-17 15:35:16,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:16,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625939633] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:16,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:16,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-17 15:35:16,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910251313] [2021-12-17 15:35:16,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:16,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:35:16,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:16,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:35:16,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:35:16,420 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-17 15:35:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:16,527 INFO L93 Difference]: Finished difference Result 6406 states and 8897 transitions. [2021-12-17 15:35:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:35:16,527 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-17 15:35:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:16,543 INFO L225 Difference]: With dead ends: 6406 [2021-12-17 15:35:16,543 INFO L226 Difference]: Without dead ends: 4230 [2021-12-17 15:35:16,549 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-17 15:35:16,550 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-17 15:35:16,550 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-17 15:35:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2021-12-17 15:35:16,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 4172. [2021-12-17 15:35:16,669 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-17 15:35:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 5708 transitions. [2021-12-17 15:35:16,686 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 5708 transitions. Word has length 117 [2021-12-17 15:35:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:16,687 INFO L470 AbstractCegarLoop]: Abstraction has 4172 states and 5708 transitions. [2021-12-17 15:35:16,687 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-17 15:35:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 5708 transitions. [2021-12-17 15:35:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-17 15:35:16,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:16,695 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-17 15:35:16,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 15:35:16,911 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-17 15:35:16,911 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash -844102889, now seen corresponding path program 1 times [2021-12-17 15:35:16,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:16,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820122568] [2021-12-17 15:35:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:16,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-17 15:35:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-17 15:35:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-17 15:35:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-17 15:35:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:16,992 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-17 15:35:16,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:16,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820122568] [2021-12-17 15:35:16,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820122568] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:16,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794116664] [2021-12-17 15:35:16,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:16,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:16,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:16,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:35:16,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 15:35:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:35:17,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:17,250 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-17 15:35:17,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:17,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794116664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:17,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:17,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:35:17,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027067382] [2021-12-17 15:35:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:17,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:35:17,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:17,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:35:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:35:17,252 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-17 15:35:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:17,357 INFO L93 Difference]: Finished difference Result 7394 states and 10137 transitions. [2021-12-17 15:35:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:35:17,357 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-17 15:35:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:17,375 INFO L225 Difference]: With dead ends: 7394 [2021-12-17 15:35:17,375 INFO L226 Difference]: Without dead ends: 4500 [2021-12-17 15:35:17,383 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-17 15:35:17,384 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-17 15:35:17,384 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-17 15:35:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2021-12-17 15:35:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 4462. [2021-12-17 15:35:17,520 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-17 15:35:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 6000 transitions. [2021-12-17 15:35:17,544 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 6000 transitions. Word has length 133 [2021-12-17 15:35:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:17,544 INFO L470 AbstractCegarLoop]: Abstraction has 4462 states and 6000 transitions. [2021-12-17 15:35:17,545 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-17 15:35:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 6000 transitions. [2021-12-17 15:35:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-17 15:35:17,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:17,553 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-17 15:35:17,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 15:35:17,770 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-17 15:35:17,771 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash -797474129, now seen corresponding path program 1 times [2021-12-17 15:35:17,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:17,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381830790] [2021-12-17 15:35:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:17,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 15:35:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:35:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 15:35:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 15:35:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,847 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-17 15:35:17,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:17,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381830790] [2021-12-17 15:35:17,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381830790] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:17,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976673011] [2021-12-17 15:35:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:17,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:17,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:17,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:35:17,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 15:35:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:17,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 15:35:17,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:18,035 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-17 15:35:18,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:18,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976673011] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:18,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:18,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:35:18,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072743561] [2021-12-17 15:35:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:18,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:35:18,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:18,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:35:18,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:35:18,038 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-17 15:35:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:18,169 INFO L93 Difference]: Finished difference Result 6829 states and 9325 transitions. [2021-12-17 15:35:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:35:18,170 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-17 15:35:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:18,187 INFO L225 Difference]: With dead ends: 6829 [2021-12-17 15:35:18,188 INFO L226 Difference]: Without dead ends: 4496 [2021-12-17 15:35:18,195 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-17 15:35:18,195 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-17 15:35:18,196 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-17 15:35:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2021-12-17 15:35:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4438. [2021-12-17 15:35:18,329 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-17 15:35:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5882 transitions. [2021-12-17 15:35:18,343 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5882 transitions. Word has length 134 [2021-12-17 15:35:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:18,344 INFO L470 AbstractCegarLoop]: Abstraction has 4438 states and 5882 transitions. [2021-12-17 15:35:18,344 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-17 15:35:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5882 transitions. [2021-12-17 15:35:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-17 15:35:18,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:18,352 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-17 15:35:18,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 15:35:18,567 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-17 15:35:18,567 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash -215256625, now seen corresponding path program 1 times [2021-12-17 15:35:18,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:18,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89105484] [2021-12-17 15:35:18,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:18,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 15:35:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:35:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 15:35:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-17 15:35:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,637 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-17 15:35:18,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:18,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89105484] [2021-12-17 15:35:18,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89105484] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:18,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530955550] [2021-12-17 15:35:18,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:18,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:18,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:18,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:35:18,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 15:35:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:18,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 15:35:18,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:18,844 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-17 15:35:18,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:18,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530955550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:18,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:18,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-17 15:35:18,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701935249] [2021-12-17 15:35:18,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:18,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 15:35:18,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:18,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 15:35:18,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-17 15:35:18,846 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-17 15:35:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:18,984 INFO L93 Difference]: Finished difference Result 7710 states and 10336 transitions. [2021-12-17 15:35:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 15:35:18,984 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-17 15:35:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:19,003 INFO L225 Difference]: With dead ends: 7710 [2021-12-17 15:35:19,004 INFO L226 Difference]: Without dead ends: 3820 [2021-12-17 15:35:19,015 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-17 15:35:19,016 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-17 15:35:19,017 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-17 15:35:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2021-12-17 15:35:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3590. [2021-12-17 15:35:19,143 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-17 15:35:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 4540 transitions. [2021-12-17 15:35:19,154 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 4540 transitions. Word has length 134 [2021-12-17 15:35:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:19,154 INFO L470 AbstractCegarLoop]: Abstraction has 3590 states and 4540 transitions. [2021-12-17 15:35:19,155 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-17 15:35:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4540 transitions. [2021-12-17 15:35:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-17 15:35:19,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:19,160 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-17 15:35:19,179 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-17 15:35:19,375 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-17 15:35:19,376 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash -564777140, now seen corresponding path program 1 times [2021-12-17 15:35:19,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:19,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757734667] [2021-12-17 15:35:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:19,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 15:35:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:35:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 15:35:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:35:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,478 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-17 15:35:19,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:19,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757734667] [2021-12-17 15:35:19,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757734667] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:19,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557555232] [2021-12-17 15:35:19,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:19,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:19,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:19,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:35:19,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 15:35:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:19,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 15:35:19,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:19,717 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-17 15:35:19,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:19,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557555232] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:19,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:19,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 15:35:19,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317988211] [2021-12-17 15:35:19,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:19,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:35:19,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:19,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:35:19,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:35:19,720 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-17 15:35:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:19,858 INFO L93 Difference]: Finished difference Result 4996 states and 6377 transitions. [2021-12-17 15:35:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 15:35:19,859 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-17 15:35:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:19,867 INFO L225 Difference]: With dead ends: 4996 [2021-12-17 15:35:19,867 INFO L226 Difference]: Without dead ends: 2670 [2021-12-17 15:35:19,873 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-17 15:35:19,873 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 137 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 15:35:19,873 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-17 15:35:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2021-12-17 15:35:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2658. [2021-12-17 15:35:19,950 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-17 15:35:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3274 transitions. [2021-12-17 15:35:19,957 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3274 transitions. Word has length 135 [2021-12-17 15:35:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:19,958 INFO L470 AbstractCegarLoop]: Abstraction has 2658 states and 3274 transitions. [2021-12-17 15:35:19,958 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-17 15:35:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3274 transitions. [2021-12-17 15:35:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-17 15:35:19,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:19,961 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-17 15:35:19,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 15:35:20,175 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-17 15:35:20,175 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1871919538, now seen corresponding path program 1 times [2021-12-17 15:35:20,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:20,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656676858] [2021-12-17 15:35:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:20,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 15:35:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:35:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 15:35:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:35:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,259 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-17 15:35:20,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:20,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656676858] [2021-12-17 15:35:20,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656676858] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:20,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371611678] [2021-12-17 15:35:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:20,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:20,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:20,261 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 15:35:20,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 15:35:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 15:35:20,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:20,484 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-17 15:35:20,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:20,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371611678] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:20,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:20,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-17 15:35:20,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586393911] [2021-12-17 15:35:20,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:20,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:35:20,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:20,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:35:20,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-17 15:35:20,486 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-17 15:35:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:20,648 INFO L93 Difference]: Finished difference Result 4962 states and 6189 transitions. [2021-12-17 15:35:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:35:20,648 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-17 15:35:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:20,663 INFO L225 Difference]: With dead ends: 4962 [2021-12-17 15:35:20,664 INFO L226 Difference]: Without dead ends: 2611 [2021-12-17 15:35:20,669 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-17 15:35:20,669 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-17 15:35:20,670 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-17 15:35:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2021-12-17 15:35:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1652. [2021-12-17 15:35:20,730 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-17 15:35:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1967 transitions. [2021-12-17 15:35:20,734 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1967 transitions. Word has length 135 [2021-12-17 15:35:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:20,734 INFO L470 AbstractCegarLoop]: Abstraction has 1652 states and 1967 transitions. [2021-12-17 15:35:20,734 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-17 15:35:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1967 transitions. [2021-12-17 15:35:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-17 15:35:20,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:20,736 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-17 15:35:20,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 15:35:20,951 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-17 15:35:20,951 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:20,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash 25577228, now seen corresponding path program 1 times [2021-12-17 15:35:20,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:20,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763682149] [2021-12-17 15:35:20,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:20,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 15:35:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:35:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 15:35:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:35:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,043 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-17 15:35:21,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:21,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763682149] [2021-12-17 15:35:21,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763682149] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:21,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990086440] [2021-12-17 15:35:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:21,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:21,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:21,045 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-17 15:35:21,046 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-17 15:35:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 15:35:21,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:21,268 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-17 15:35:21,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:21,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990086440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:21,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:21,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 15:35:21,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229060311] [2021-12-17 15:35:21,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:21,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:35:21,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:21,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:35:21,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:35:21,270 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-17 15:35:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:21,347 INFO L93 Difference]: Finished difference Result 2779 states and 3331 transitions. [2021-12-17 15:35:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:35:21,347 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-17 15:35:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:21,351 INFO L225 Difference]: With dead ends: 2779 [2021-12-17 15:35:21,351 INFO L226 Difference]: Without dead ends: 1137 [2021-12-17 15:35:21,354 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-17 15:35:21,355 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-17 15:35:21,355 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-17 15:35:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2021-12-17 15:35:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1101. [2021-12-17 15:35:21,391 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-17 15:35:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1274 transitions. [2021-12-17 15:35:21,394 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1274 transitions. Word has length 135 [2021-12-17 15:35:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:21,394 INFO L470 AbstractCegarLoop]: Abstraction has 1101 states and 1274 transitions. [2021-12-17 15:35:21,394 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-17 15:35:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1274 transitions. [2021-12-17 15:35:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-17 15:35:21,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:21,396 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-17 15:35:21,415 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-17 15:35:21,603 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-17 15:35:21,603 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:21,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 537608328, now seen corresponding path program 1 times [2021-12-17 15:35:21,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:21,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857033254] [2021-12-17 15:35:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:21,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 15:35:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:35:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 15:35:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:35:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,684 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-17 15:35:21,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:21,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857033254] [2021-12-17 15:35:21,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857033254] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 15:35:21,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372496845] [2021-12-17 15:35:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:21,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 15:35:21,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 15:35:21,686 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-17 15:35:21,687 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-17 15:35:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:21,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 15:35:21,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 15:35:21,913 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-17 15:35:21,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 15:35:21,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372496845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:21,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-17 15:35:21,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-17 15:35:21,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995224660] [2021-12-17 15:35:21,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:21,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 15:35:21,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:21,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 15:35:21,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 15:35:21,914 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-17 15:35:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:21,961 INFO L93 Difference]: Finished difference Result 2220 states and 2613 transitions. [2021-12-17 15:35:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 15:35:21,961 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-17 15:35:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:21,964 INFO L225 Difference]: With dead ends: 2220 [2021-12-17 15:35:21,964 INFO L226 Difference]: Without dead ends: 1129 [2021-12-17 15:35:21,966 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-17 15:35:21,967 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-17 15:35:21,967 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-17 15:35:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-12-17 15:35:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1113. [2021-12-17 15:35:22,002 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-17 15:35:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1265 transitions. [2021-12-17 15:35:22,004 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1265 transitions. Word has length 135 [2021-12-17 15:35:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:22,004 INFO L470 AbstractCegarLoop]: Abstraction has 1113 states and 1265 transitions. [2021-12-17 15:35:22,004 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-17 15:35:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1265 transitions. [2021-12-17 15:35:22,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-17 15:35:22,006 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:22,006 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:35:22,023 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-17 15:35:22,219 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-17 15:35:22,219 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:22,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash -219686780, now seen corresponding path program 1 times [2021-12-17 15:35:22,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:22,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828055845] [2021-12-17 15:35:22,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:22,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 15:35:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:35:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 15:35:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:35:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-17 15:35:22,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:22,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828055845] [2021-12-17 15:35:22,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828055845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:22,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:22,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:35:22,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159917217] [2021-12-17 15:35:22,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:22,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:35:22,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:22,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:35:22,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:35:22,312 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-17 15:35:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:22,661 INFO L93 Difference]: Finished difference Result 2070 states and 2337 transitions. [2021-12-17 15:35:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 15:35:22,661 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-17 15:35:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:22,666 INFO L225 Difference]: With dead ends: 2070 [2021-12-17 15:35:22,666 INFO L226 Difference]: Without dead ends: 2068 [2021-12-17 15:35:22,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-17 15:35:22,667 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-17 15:35:22,667 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-17 15:35:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2021-12-17 15:35:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1489. [2021-12-17 15:35:22,732 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-17 15:35:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1693 transitions. [2021-12-17 15:35:22,735 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1693 transitions. Word has length 135 [2021-12-17 15:35:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:22,735 INFO L470 AbstractCegarLoop]: Abstraction has 1489 states and 1693 transitions. [2021-12-17 15:35:22,735 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-17 15:35:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1693 transitions. [2021-12-17 15:35:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-17 15:35:22,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 15:35:22,738 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-17 15:35:22,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 15:35:22,738 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 15:35:22,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 15:35:22,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1479334343, now seen corresponding path program 2 times [2021-12-17 15:35:22,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 15:35:22,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597396654] [2021-12-17 15:35:22,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 15:35:22,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 15:35:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 15:35:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 15:35:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-17 15:35:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-17 15:35:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-17 15:35:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-17 15:35:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-17 15:35:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-17 15:35:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-17 15:35:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-17 15:35:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-17 15:35:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-17 15:35:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 15:35:22,828 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-17 15:35:22,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 15:35:22,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597396654] [2021-12-17 15:35:22,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597396654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 15:35:22,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 15:35:22,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 15:35:22,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308236293] [2021-12-17 15:35:22,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 15:35:22,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 15:35:22,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 15:35:22,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 15:35:22,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 15:35:22,830 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-17 15:35:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 15:35:23,224 INFO L93 Difference]: Finished difference Result 3212 states and 3666 transitions. [2021-12-17 15:35:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 15:35:23,225 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-17 15:35:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 15:35:23,226 INFO L225 Difference]: With dead ends: 3212 [2021-12-17 15:35:23,226 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 15:35:23,230 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-17 15:35:23,230 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-17 15:35:23,231 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-17 15:35:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 15:35:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 15:35:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 15:35:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 15:35:23,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2021-12-17 15:35:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 15:35:23,232 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 15:35:23,232 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-17 15:35:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 15:35:23,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 15:35:23,234 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 15:35:23,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 15:35:23,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 15:35:35,531 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2021-12-17 15:35:35,532 INFO L854 garLoopResultBuilder]: At program point L155(lines 139 157) the Hoare annotation is: (let ((.cse16 (<= 0 |activate_threads_is_transmit1_triggered_#res#1|)) (.cse17 (<= |activate_threads_is_transmit1_triggered_#res#1| 0)) (.cse22 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse23 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse19 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse20 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse15 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse18 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse21 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse24 (<= |activate_threads_~tmp~1#1| 0)) (.cse25 (< 0 (+ |activate_threads_~tmp~1#1| 1)))) (let ((.cse11 (not (= |old(~m_st~0)| 0))) (.cse1 (and .cse14 .cse15 .cse18 .cse21 .cse24 .cse25 (<= 2 ~m_st~0))) (.cse27 (and .cse14 .cse15 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25)) (.cse2 (not (= ~m_pc~0 0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse12 (= 0 |old(~t1_st~0)|)) (.cse13 (not (<= ~token~0 (+ ~local~0 1)))) (.cse26 (not (< ~local~0 ~token~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse10 (not (<= 1 ~m_pc~0))) (.cse7 (not (= ~token~0 ~local~0))) (.cse8 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse21 .cse23 .cse24 .cse25)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse7 .cse8) (or .cse0 .cse9 .cse3 .cse10 .cse7 .cse8 .cse5 .cse6) (or .cse0 .cse9 .cse11 .cse3 .cse12 .cse13 .cse10 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse26 .cse6) (or .cse0 .cse9 .cse3 .cse12 .cse10 .cse8 .cse5 .cse6) (or .cse0 .cse9 .cse11 .cse2 .cse3 .cse12 .cse8 .cse6) (or .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (or .cse27 .cse0 .cse9 .cse3 .cse12 .cse10 .cse7) (or .cse0 .cse27 .cse9 .cse2 .cse3 .cse12 .cse7) (or .cse9 .cse3 .cse12 .cse13 (and .cse16 .cse17 .cse19 .cse20 .cse22 .cse24 .cse23 .cse25) .cse10 .cse26 .cse5 (and .cse16 .cse17 (= ~m_st~0 0) (not (= 0 ~t1_st~0)) .cse22 .cse23) .cse6) (or .cse0 .cse3 .cse4 .cse10 .cse7 .cse8 .cse5 .cse6)))) [2021-12-17 15:35:35,532 INFO L858 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2021-12-17 15:35:35,532 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2021-12-17 15:35:35,532 INFO L858 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2021-12-17 15:35:35,533 INFO L854 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse15 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse10 (not (= |old(~m_st~0)| 0))) (.cse11 (= 0 |old(~t1_st~0)|)) (.cse12 (not (<= ~token~0 (+ ~local~0 1)))) (.cse6 (not (<= 1 ~m_pc~0))) (.cse13 (not (< ~local~0 ~token~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse1 (and (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0) (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) .cse14 .cse15)) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse5 .cse7 .cse8) (or .cse0 .cse9 .cse10 .cse1 .cse2 .cse3 .cse11 .cse8) (or .cse0 .cse9 .cse1 .cse3 .cse11 .cse6 .cse5) (or .cse0 .cse9 .cse1 .cse3 .cse11 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8) (or .cse0 .cse9 .cse1 .cse3 .cse6 .cse5 .cse7 .cse8) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse11 .cse5) (or .cse0 .cse9 .cse10 .cse1 .cse3 .cse11 .cse12 .cse6 .cse13 .cse8) (or .cse9 .cse3 .cse11 .cse12 .cse6 (and .cse14 .cse15) .cse13 .cse7 .cse8) (or .cse9 .cse1 .cse2 .cse3 .cse7 .cse8)))) [2021-12-17 15:35:35,533 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-12-17 15:35:35,533 INFO L858 garLoopResultBuilder]: For program point L327-2(lines 311 335) no Hoare annotation was computed. [2021-12-17 15:35:35,533 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2021-12-17 15:35:35,533 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2021-12-17 15:35:35,533 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 319 323) no Hoare annotation was computed. [2021-12-17 15:35:35,533 INFO L854 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (let ((.cse18 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse20 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse16 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse23 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse24 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse25 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse19 (<= |activate_threads_~tmp~1#1| 0)) (.cse21 (< 0 (+ |activate_threads_~tmp~1#1| 1)))) (let ((.cse10 (and .cse22 .cse23 .cse24 .cse25 .cse19 .cse21 (<= 2 ~m_st~0))) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse15 (and .cse22 .cse23 .cse24 .cse16 .cse17 .cse25 .cse19 .cse21)) (.cse0 (and .cse22 .cse23 .cse24 .cse16 .cse17 .cse18 .cse25 .cse20 .cse19 .cse21)) (.cse1 (not (<= 2 ~E_M~0))) (.cse11 (not (= ~m_pc~0 0))) (.cse12 (not (<= ~t1_pc~0 0))) (.cse14 (not (= ~token~0 ~local~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (= 0 |old(~t1_st~0)|)) (.cse6 (not (<= ~token~0 (+ ~local~0 1)))) (.cse7 (not (<= 1 ~m_pc~0))) (.cse8 (not (< ~local~0 ~token~0))) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse10 .cse11 .cse4 .cse12 .cse13 .cse9) (or .cse0 .cse1 .cse4 .cse12 .cse7 .cse14 .cse13 .cse9) (or .cse1 .cse15 .cse2 .cse4 .cse5 .cse7 .cse14) (or .cse2 .cse10 .cse11 .cse4 .cse13 .cse9) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse13 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse5 .cse9) (or .cse0 .cse1 .cse2 .cse4 .cse7 .cse14 .cse13 .cse9) (or .cse1 .cse2 .cse15 .cse11 .cse4 .cse5 .cse14) (or .cse0 .cse1 .cse11 .cse4 .cse12 .cse14) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 (and (= ~m_st~0 0) (not (= 0 ~t1_st~0)) .cse18 .cse20))))) [2021-12-17 15:35:35,534 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-12-17 15:35:35,534 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 311 335) the Hoare annotation is: (let ((.cse2 (not (= |old(~m_st~0)| 0))) (.cse10 (not (<= ~t1_pc~0 0))) (.cse13 (not (= ~m_pc~0 0))) (.cse4 (= 0 |old(~t1_st~0)|)) (.cse5 (not (<= ~token~0 (+ ~local~0 1)))) (.cse8 (not (< ~local~0 ~token~0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (<= 1 ~m_pc~0))) (.cse11 (not (= ~token~0 ~local~0))) (.cse7 (and (= ~t1_st~0 |old(~t1_st~0)|) (= ~m_st~0 |old(~m_st~0)|))) (.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse3 .cse10 .cse6 .cse7 .cse11 .cse12 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse11) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse12 .cse9) (or .cse0 .cse1 .cse13 .cse3 .cse4 .cse7 .cse11) (or .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse7 .cse9) (or .cse0 .cse13 .cse3 .cse10 .cse7 .cse12 .cse9) (or .cse0 .cse13 .cse3 .cse10 .cse11 .cse7) (or .cse1 .cse13 .cse3 .cse7 .cse12 .cse9) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9) (or .cse0 .cse1 .cse3 .cse6 .cse11 .cse7 .cse12 .cse9))) [2021-12-17 15:35:35,534 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 311 335) no Hoare annotation was computed. [2021-12-17 15:35:35,534 INFO L854 garLoopResultBuilder]: At program point L136(lines 120 138) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 |old(~t1_st~0)|)) (.cse15 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (= |old(~m_st~0)| 0))) (.cse8 (not (= ~m_pc~0 0))) (.cse13 (not (<= ~t1_pc~0 0))) (.cse0 (and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0) (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) .cse14 .cse15 (<= |activate_threads_is_master_triggered_#res#1| 0))) (.cse1 (not (<= 2 ~E_M~0))) (.cse5 (not (= ~token~0 ~local~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse10 (= 0 |old(~t1_st~0)|)) (.cse11 (not (<= ~token~0 (+ ~local~0 1)))) (.cse4 (not (<= 1 ~m_pc~0))) (.cse12 (not (< ~local~0 ~token~0))) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse8 .cse3 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse9 .cse8 .cse3 .cse10 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse10 .cse5) (or .cse0 .cse1 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse13 .cse5) (or .cse0 .cse1 .cse8 .cse3 .cse13 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (or .cse2 .cse3 .cse10 .cse11 .cse4 (and .cse14 .cse15) .cse12 .cse6 .cse7)))) [2021-12-17 15:35:35,534 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 336 346) no Hoare annotation was computed. [2021-12-17 15:35:35,534 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 336 346) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~E_M~0))) (.cse6 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~m_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (= 0 |old(~t1_st~0)|)) (.cse4 (not (<= 1 ~m_pc~0))) (.cse5 (and (= ~t1_st~0 |old(~t1_st~0)|) (= ~m_st~0 |old(~m_st~0)|))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (or .cse0 .cse7 .cse2 (not (<= ~t1_pc~0 0)) .cse6 .cse5) (or .cse1 .cse7 .cse2 .cse5 .cse8 .cse9) (or .cse1 .cse2 .cse3 (not (<= ~token~0 (+ ~local~0 1))) .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse8 .cse9))) [2021-12-17 15:35:35,535 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 336 346) no Hoare annotation was computed. [2021-12-17 15:35:35,535 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 197) no Hoare annotation was computed. [2021-12-17 15:35:35,535 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 184 203) no Hoare annotation was computed. [2021-12-17 15:35:35,535 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 198) no Hoare annotation was computed. [2021-12-17 15:35:35,535 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 184 203) the Hoare annotation is: true [2021-12-17 15:35:35,535 INFO L861 garLoopResultBuilder]: At program point L200(lines 187 202) the Hoare annotation is: true [2021-12-17 15:35:35,535 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 184 203) no Hoare annotation was computed. [2021-12-17 15:35:35,535 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 255 282) the Hoare annotation is: (let ((.cse0 (= 0 ~t1_st~0)) (.cse2 (not (= ~m_st~0 0))) (.cse8 (not (<= 1 ~m_pc~0))) (.cse10 (not (= ~token~0 ~local~0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse9 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (and (= ~E_M~0 |old(~E_M~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~T1_E~0 |old(~T1_E~0)|))) (.cse7 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 (not (<= ~token~0 (+ ~local~0 1))) .cse8 (not (< ~local~0 ~token~0)) .cse5 .cse6 .cse7) (or .cse1 .cse9 .cse4 .cse8 .cse10 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse4 .cse8 .cse5 .cse6 .cse7) (or .cse2 .cse3 .cse4 .cse11 .cse10 .cse5 .cse6 .cse7) (or .cse9 .cse4 .cse11 .cse8 .cse10 .cse5 .cse6 .cse7) (or .cse9 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (or .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-12-17 15:35:35,536 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 255 282) no Hoare annotation was computed. [2021-12-17 15:35:35,536 INFO L858 garLoopResultBuilder]: For program point L274-1(lines 255 282) no Hoare annotation was computed. [2021-12-17 15:35:35,536 INFO L858 garLoopResultBuilder]: For program point L269-1(lines 258 281) no Hoare annotation was computed. [2021-12-17 15:35:35,536 INFO L858 garLoopResultBuilder]: For program point L264-1(lines 258 281) no Hoare annotation was computed. [2021-12-17 15:35:35,536 INFO L858 garLoopResultBuilder]: For program point L259-1(lines 258 281) no Hoare annotation was computed. [2021-12-17 15:35:35,536 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 158 165) no Hoare annotation was computed. [2021-12-17 15:35:35,536 INFO L861 garLoopResultBuilder]: At program point update_channelsFINAL(lines 158 165) the Hoare annotation is: true [2021-12-17 15:35:35,536 INFO L858 garLoopResultBuilder]: For program point L287-1(lines 286 309) no Hoare annotation was computed. [2021-12-17 15:35:35,536 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 283 310) the Hoare annotation is: (let ((.cse0 (= 0 ~t1_st~0)) (.cse2 (not (= ~m_st~0 0))) (.cse8 (not (<= 1 ~m_pc~0))) (.cse10 (not (= ~token~0 ~local~0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse9 (not (<= 2 ~m_st~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (and (= ~E_M~0 |old(~E_M~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~T1_E~0 |old(~T1_E~0)|))) (.cse7 (not (<= 2 |old(~T1_E~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 (not (<= ~token~0 (+ ~local~0 1))) .cse8 (not (< ~local~0 ~token~0)) .cse5 .cse6 .cse7) (or .cse1 .cse9 .cse4 .cse8 .cse10 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse9 .cse4 .cse8 .cse5 .cse6 .cse7) (or .cse2 .cse3 .cse4 .cse11 .cse10 .cse5 .cse6 .cse7) (or .cse9 .cse4 .cse11 .cse8 .cse10 .cse5 .cse6 .cse7) (or .cse9 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (or .cse1 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7))) [2021-12-17 15:35:35,537 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 283 310) no Hoare annotation was computed. [2021-12-17 15:35:35,537 INFO L858 garLoopResultBuilder]: For program point L302-1(lines 283 310) no Hoare annotation was computed. [2021-12-17 15:35:35,537 INFO L858 garLoopResultBuilder]: For program point L297-1(lines 286 309) no Hoare annotation was computed. [2021-12-17 15:35:35,537 INFO L858 garLoopResultBuilder]: For program point L292-1(lines 286 309) no Hoare annotation was computed. [2021-12-17 15:35:35,537 INFO L861 garLoopResultBuilder]: At program point L481(lines 472 483) the Hoare annotation is: true [2021-12-17 15:35:35,537 INFO L854 garLoopResultBuilder]: At program point L234(lines 210 248) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,537 INFO L854 garLoopResultBuilder]: At program point L69-1(lines 43 82) the Hoare annotation is: (let ((.cse2 (not (= 0 ~t1_st~0))) (.cse3 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_M~0)) (.cse4 (<= 2 ~E_1~0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= 1 ~m_pc~0) .cse3 .cse4) (and (= ~token~0 ~local~0) .cse0 (<= ~t1_pc~0 0) .cse1 .cse4 .cse5))) [2021-12-17 15:35:35,537 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 15:35:35,538 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-12-17 15:35:35,538 INFO L861 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: true [2021-12-17 15:35:35,538 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,538 INFO L858 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2021-12-17 15:35:35,538 INFO L854 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2021-12-17 15:35:35,538 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 174) no Hoare annotation was computed. [2021-12-17 15:35:35,538 INFO L858 garLoopResultBuilder]: For program point L170-2(lines 169 182) no Hoare annotation was computed. [2021-12-17 15:35:35,538 INFO L854 garLoopResultBuilder]: At program point L451(line 451) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,539 INFO L858 garLoopResultBuilder]: For program point L451-1(line 451) no Hoare annotation was computed. [2021-12-17 15:35:35,539 INFO L858 garLoopResultBuilder]: For program point L220(lines 210 248) no Hoare annotation was computed. [2021-12-17 15:35:35,539 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2021-12-17 15:35:35,539 INFO L858 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2021-12-17 15:35:35,539 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2021-12-17 15:35:35,539 INFO L854 garLoopResultBuilder]: At program point L353(lines 347 355) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6))) [2021-12-17 15:35:35,539 INFO L858 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2021-12-17 15:35:35,539 INFO L854 garLoopResultBuilder]: At program point L436(line 436) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,540 INFO L858 garLoopResultBuilder]: For program point L436-1(line 436) no Hoare annotation was computed. [2021-12-17 15:35:35,540 INFO L858 garLoopResultBuilder]: For program point L370-1(lines 359 382) no Hoare annotation was computed. [2021-12-17 15:35:35,540 INFO L854 garLoopResultBuilder]: At program point L421(line 421) the Hoare annotation is: (and (= ~token~0 ~local~0) (<= ~t1_pc~0 0) (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) (= ~m_st~0 0) (= ~E_1~0 ~M_E~0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0)) [2021-12-17 15:35:35,540 INFO L858 garLoopResultBuilder]: For program point L421-1(line 421) no Hoare annotation was computed. [2021-12-17 15:35:35,540 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 15:35:35,540 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2021-12-17 15:35:35,540 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-12-17 15:35:35,540 INFO L854 garLoopResultBuilder]: At program point L92(lines 87 118) the Hoare annotation is: (let ((.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (<= 2 ~m_st~0))) (or (and (= ~token~0 ~local~0) .cse0 .cse1 (not (= 0 ~t1_st~0)) (<= 1 ~m_pc~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 0) .cse4))) [2021-12-17 15:35:35,540 INFO L854 garLoopResultBuilder]: At program point L175-1(lines 166 183) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0)) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5))) [2021-12-17 15:35:35,541 INFO L854 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (<= 2 ~T1_E~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (<= 2 ~m_st~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) (not (= 0 ~t1_st~0)) (< ~local~0 ~token~0) (<= 1 ~m_pc~0) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (= ~m_pc~0 0) .cse3))) [2021-12-17 15:35:35,541 INFO L858 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2021-12-17 15:35:35,541 INFO L854 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0)) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5))) [2021-12-17 15:35:35,541 INFO L854 garLoopResultBuilder]: At program point L423-1(line 423) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0)) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5))) [2021-12-17 15:35:35,541 INFO L854 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,541 INFO L854 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,541 INFO L854 garLoopResultBuilder]: At program point L77(lines 40 83) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~E_1~0)) (.cse5 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~t1_pc~0 1) .cse4 .cse5) (and .cse0 .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 .cse4 .cse5))) [2021-12-17 15:35:35,542 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-12-17 15:35:35,542 INFO L854 garLoopResultBuilder]: At program point L424(line 424) the Hoare annotation is: (let ((.cse0 (<= ~t1_pc~0 0)) (.cse1 (= 2 ~M_E~0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0)) (and (= ~token~0 ~local~0) .cse0 .cse1 .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5))) [2021-12-17 15:35:35,542 INFO L854 garLoopResultBuilder]: At program point L391(lines 384 393) the Hoare annotation is: (and (= ~token~0 ~local~0) (<= ~t1_pc~0 0) (= 2 ~M_E~0) (= ~T1_E~0 ~M_E~0) (= ~m_st~0 0) (= ~E_1~0 ~M_E~0) (= ~E_M~0 ~M_E~0) (= ~m_pc~0 0)) [2021-12-17 15:35:35,542 INFO L854 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse0 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse4 (not (= 0 ~t1_st~0))) (.cse5 (= ~t1_pc~0 1))) (or (and .cse0 .cse1 (<= ~t1_pc~0 0) .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse2 .cse4 (<= 1 ~m_pc~0) .cse5))) [2021-12-17 15:35:35,542 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 15:35:35,542 INFO L858 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2021-12-17 15:35:35,542 INFO L854 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,542 INFO L854 garLoopResultBuilder]: At program point L375-1(lines 356 383) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,543 INFO L854 garLoopResultBuilder]: At program point L442(line 442) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,543 INFO L854 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,543 INFO L854 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,543 INFO L858 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2021-12-17 15:35:35,543 INFO L858 garLoopResultBuilder]: For program point L360-2(lines 359 382) no Hoare annotation was computed. [2021-12-17 15:35:35,543 INFO L854 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,543 INFO L854 garLoopResultBuilder]: At program point L113(lines 84 119) the Hoare annotation is: (let ((.cse3 (<= 1 ~m_pc~0)) (.cse6 (<= 2 ~m_st~0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_M~0)) (.cse7 (= ~m_st~0 0)) (.cse2 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse8 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse7 .cse2 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse4 .cse5 .cse8))) [2021-12-17 15:35:35,544 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2021-12-17 15:35:35,544 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2021-12-17 15:35:35,544 INFO L858 garLoopResultBuilder]: For program point L213(line 213) no Hoare annotation was computed. [2021-12-17 15:35:35,544 INFO L854 garLoopResultBuilder]: At program point L48(lines 43 82) the Hoare annotation is: (and (<= 2 ~T1_E~0) (<= ~token~0 (+ ~local~0 1)) (<= 2 ~E_M~0) (not (= 0 ~t1_st~0)) (< ~local~0 ~token~0) (<= 1 ~m_pc~0) (= ~t1_pc~0 1) (<= 2 ~E_1~0)) [2021-12-17 15:35:35,544 INFO L854 garLoopResultBuilder]: At program point L428-1(lines 425 465) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,544 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 15:35:35,544 INFO L858 garLoopResultBuilder]: For program point L445(line 445) no Hoare annotation was computed. [2021-12-17 15:35:35,544 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-12-17 15:35:35,545 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2021-12-17 15:35:35,545 INFO L854 garLoopResultBuilder]: At program point L99-1(lines 87 118) the Hoare annotation is: (let ((.cse5 (= ~m_pc~0 0)) (.cse2 (= ~m_st~0 0)) (.cse0 (<= 2 ~T1_E~0)) (.cse1 (<= 2 ~E_M~0)) (.cse3 (not (= 0 ~t1_st~0))) (.cse7 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~E_1~0)) (.cse6 (<= 2 ~m_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 (< ~local~0 ~token~0) .cse7 .cse4) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse6))) [2021-12-17 15:35:35,545 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2021-12-17 15:35:35,545 INFO L858 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2021-12-17 15:35:35,545 INFO L858 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2021-12-17 15:35:35,545 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 456) no Hoare annotation was computed. [2021-12-17 15:35:35,545 INFO L858 garLoopResultBuilder]: For program point L447-2(lines 447 456) no Hoare annotation was computed. [2021-12-17 15:35:35,545 INFO L854 garLoopResultBuilder]: At program point L249(lines 204 254) the Hoare annotation is: (let ((.cse0 (= ~token~0 ~local~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (<= 2 ~E_M~0)) (.cse9 (= ~m_st~0 0)) (.cse7 (not (= 0 ~t1_st~0))) (.cse4 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse10 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse5 .cse10) (and .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse9 .cse7 (< ~local~0 ~token~0) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5 .cse10))) [2021-12-17 15:35:35,546 INFO L858 garLoopResultBuilder]: For program point L365-1(lines 359 382) no Hoare annotation was computed. [2021-12-17 15:35:35,548 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 15:35:35,549 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 15:35:35,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 03:35:35 BoogieIcfgContainer [2021-12-17 15:35:35,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 15:35:35,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 15:35:35,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 15:35:35,584 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 15:35:35,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 03:35:11" (3/4) ... [2021-12-17 15:35:35,586 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 15:35:35,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-12-17 15:35:35,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-17 15:35:35,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-12-17 15:35:35,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-12-17 15:35:35,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-12-17 15:35:35,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-12-17 15:35:35,594 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-12-17 15:35:35,595 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-17 15:35:35,595 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 15:35:35,595 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 15:35:35,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(2 <= E_M) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(token == local)) && (((((((!(2 <= E_M) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(t1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(token == local))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(2 <= E_M) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(t1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token == local))) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= E_1))) && ((((((((!(t1_pc == 1) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(local < token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((!(t1_pc == 1) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(2 <= E_1)) [2021-12-17 15:35:35,610 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= E_1))) && ((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(2 <= E_1))) && (((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token == local))) && ((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(token == local))) && (((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(token == local))) && ((((((((!(t1_pc == 1) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(local < token)) || !(2 <= \old(m_st))) || !(2 <= E_1)) [2021-12-17 15:35:35,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= E_1)) && ((((((!(2 <= E_M) || ((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) && 2 <= m_st)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(2 <= E_M) || (((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(token == local))) && (((((!(t1_pc == 1) || ((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) && 2 <= m_st)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(t1_pc == 1)) || (((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && 0 < tmp + 1)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token == local))) && ((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(token == local))) && ((((((((((((((t1_st == \old(t1_st) && m_st == \old(m_st)) && __retres1 <= 0) && tmp <= 0) && 0 <= __retres1) && 0 < tmp + 1) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= \old(m_st))) || !(2 <= E_1)) || (((m_st == 0 && !(0 == t1_st)) && __retres1 <= 0) && 0 <= __retres1)) [2021-12-17 15:35:35,611 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= E_M) || ((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) && 2 <= m_st)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((!(2 <= E_M) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(token == local)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || !(1 <= m_pc)) || !(token == local)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(local < token)) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(2 <= E_1))) && (((((!(t1_pc == 1) || ((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) && 2 <= m_st)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(token == local))) && ((((((!(2 <= E_M) || (((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token == local))) && (((((((((!(t1_pc == 1) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || (((((((0 <= \result && \result <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && tmp <= 0) && 0 <= __retres1) && 0 < tmp + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= \old(m_st))) || (((((0 <= \result && \result <= 0) && m_st == 0) && !(0 == t1_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 <= m_pc)) || !(token == local)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) [2021-12-17 15:35:35,628 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 15:35:35,628 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 15:35:35,628 INFO L158 Benchmark]: Toolchain (without parser) took 24417.64ms. Allocated memory was 115.3MB in the beginning and 633.3MB in the end (delta: 518.0MB). Free memory was 79.7MB in the beginning and 352.8MB in the end (delta: -273.1MB). Peak memory consumption was 244.9MB. Max. memory is 16.1GB. [2021-12-17 15:35:35,628 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory was 88.6MB in the beginning and 88.5MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 15:35:35,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.12ms. Allocated memory is still 115.3MB. Free memory was 79.4MB in the beginning and 88.8MB in the end (delta: -9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 15:35:35,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.70ms. Allocated memory is still 115.3MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:35:35,629 INFO L158 Benchmark]: Boogie Preprocessor took 34.68ms. Allocated memory is still 115.3MB. Free memory was 86.7MB in the beginning and 85.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 15:35:35,629 INFO L158 Benchmark]: RCFGBuilder took 297.83ms. Allocated memory is still 115.3MB. Free memory was 85.1MB in the beginning and 70.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 15:35:35,630 INFO L158 Benchmark]: TraceAbstraction took 23721.22ms. Allocated memory was 115.3MB in the beginning and 633.3MB in the end (delta: 518.0MB). Free memory was 69.9MB in the beginning and 360.1MB in the end (delta: -290.2MB). Peak memory consumption was 398.7MB. Max. memory is 16.1GB. [2021-12-17 15:35:35,630 INFO L158 Benchmark]: Witness Printer took 44.63ms. Allocated memory is still 633.3MB. Free memory was 360.1MB in the beginning and 352.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-17 15:35:35,631 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.17ms. Allocated memory is still 115.3MB. Free memory was 88.6MB in the beginning and 88.5MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.12ms. Allocated memory is still 115.3MB. Free memory was 79.4MB in the beginning and 88.8MB in the end (delta: -9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.70ms. Allocated memory is still 115.3MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.68ms. Allocated memory is still 115.3MB. Free memory was 86.7MB in the beginning and 85.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.83ms. Allocated memory is still 115.3MB. Free memory was 85.1MB in the beginning and 70.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23721.22ms. Allocated memory was 115.3MB in the beginning and 633.3MB in the end (delta: 518.0MB). Free memory was 69.9MB in the beginning and 360.1MB in the end (delta: -290.2MB). Peak memory consumption was 398.7MB. Max. memory is 16.1GB. * Witness Printer took 44.63ms. Allocated memory is still 633.3MB. Free memory was 360.1MB in the beginning and 352.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.3s, 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.2s 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.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s 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: (((((((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= E_1))) && ((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(2 <= E_1))) && (((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token == local))) && ((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(token == local))) && (((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(token == local))) && ((((((((!(t1_pc == 1) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(local < token)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((token == local && 2 <= T1_E) && 2 <= E_M) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || ((((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && 1 <= m_pc) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && m_st == 0) && 2 <= E_1) && m_pc == 0)) || ((((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1)) || (((((2 <= T1_E && 2 <= E_M) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || (((((2 <= T1_E && t1_pc <= 0) && 2 <= E_M) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || ((((((2 <= T1_E && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((t1_pc <= 0 && 2 == M_E) && T1_E == M_E) && E_1 == M_E) && E_M == M_E) && m_pc == 0) && 2 <= m_st) || (((((((token == local && t1_pc <= 0) && 2 == M_E) && T1_E == M_E) && m_st == 0) && E_1 == M_E) && E_M == M_E) && m_pc == 0) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((token == local && 2 <= T1_E) && 2 <= E_M) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || ((((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && 1 <= m_pc) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && m_st == 0) && 2 <= E_1) && m_pc == 0)) || ((((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1)) || (((((2 <= T1_E && t1_pc <= 0) && 2 <= E_M) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || (((((2 <= T1_E && 2 <= E_M) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || ((((((2 <= T1_E && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= E_1)) && ((((((!(2 <= E_M) || ((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) && 2 <= m_st)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(2 <= E_M) || (((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(token == local))) && (((((!(t1_pc == 1) || ((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) && 2 <= m_st)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(t1_pc == 1)) || (((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && 0 < tmp + 1)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token == local))) && ((((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(token == local))) && ((((((((((((((t1_st == \old(t1_st) && m_st == \old(m_st)) && __retres1 <= 0) && tmp <= 0) && 0 <= __retres1) && 0 < tmp + 1) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= \old(m_st))) || !(2 <= E_1)) || (((m_st == 0 && !(0 == t1_st)) && __retres1 <= 0) && 0 <= __retres1)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((token == local && 2 <= T1_E) && 2 <= E_M) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || ((((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && 1 <= m_pc) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && m_st == 0) && 2 <= E_1) && m_pc == 0)) || ((((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1)) || (((((2 <= T1_E && 2 <= E_M) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || (((((2 <= T1_E && t1_pc <= 0) && 2 <= E_M) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || ((((((2 <= T1_E && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((token == local && 2 <= T1_E) && 2 <= E_M) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || ((((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && 1 <= m_pc) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && m_st == 0) && 2 <= E_1) && m_pc == 0)) || ((((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1)) || (((((2 <= T1_E && 2 <= E_M) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || (((((2 <= T1_E && t1_pc <= 0) && 2 <= E_M) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || ((((((2 <= T1_E && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((token == local && 2 <= T1_E) && 2 <= E_M) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && 1 <= m_pc) && 2 <= E_1) && 2 <= m_st) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= E_M) || ((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) && 2 <= m_st)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && (((((!(2 <= E_M) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(token == local)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || !(1 <= m_pc)) || !(token == local)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(local < token)) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(2 <= E_1))) && (((((!(t1_pc == 1) || ((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) && 2 <= m_st)) || !(m_pc == 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && 0 < tmp + 1) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(token == local))) && ((((((!(2 <= E_M) || (((((((0 <= \result && __retres1 <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && 0 < tmp + 1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token == local))) && (((((((((!(t1_pc == 1) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || (((((((0 <= \result && \result <= 0) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && tmp <= 0) && 0 <= __retres1) && 0 < tmp + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= \old(m_st))) || (((((0 <= \result && \result <= 0) && m_st == 0) && !(0 == t1_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 <= m_pc)) || !(token == local)) || (((((((((((0 <= \result && __retres1 <= 0) && 0 <= \result) && \result <= 0) && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st)) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && tmp <= 0) && 0 < tmp + 1)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) || (((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1)) || (((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && 2 <= E_1) && m_pc == 0) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((token == local && 2 <= T1_E) && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || (((((2 <= T1_E && 2 <= E_M) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) && 2 <= m_st) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || ((((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1)) || (((((2 <= T1_E && 2 <= E_M) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || ((((((2 <= T1_E && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((token == local && 2 <= T1_E) && 2 <= E_M) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || ((((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && 1 <= m_pc) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && m_st == 0) && 2 <= E_1) && m_pc == 0)) || ((((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1)) || (((((2 <= T1_E && t1_pc <= 0) && 2 <= E_M) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || ((((((2 <= T1_E && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && t1_pc == 1) && 2 <= E_1) && m_pc == 0)) || (((((2 <= T1_E && 2 <= E_M) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) && 2 <= m_st) - 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 <= T1_E && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && 2 <= E_1) && m_pc == 0) || ((((2 <= T1_E && 2 <= E_M) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || (((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && 2 <= E_1)) || (((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && 2 <= E_1) && 2 <= m_st) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((token == local && 2 <= T1_E) && 2 <= E_M) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || ((((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && 1 <= m_pc) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && m_st == 0) && 2 <= E_1) && m_pc == 0)) || ((((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1)) || (((((2 <= T1_E && 2 <= E_M) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || (((((2 <= T1_E && t1_pc <= 0) && 2 <= E_M) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || ((((((2 <= T1_E && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((((!(2 <= E_M) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(token == local)) && (((((((!(2 <= E_M) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(t1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(token == local))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(1 <= m_pc)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(2 <= E_M) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(t1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || !(1 <= m_pc)) || !(token == local)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(t1_pc == 1)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token == local))) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(\old(m_st) == 0)) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || !(local < token)) || !(2 <= E_1))) && ((((((((!(t1_pc == 1) || !(2 <= T1_E)) || 0 == \old(t1_st)) || !(token <= local + 1)) || !(1 <= m_pc)) || (t1_st == \old(t1_st) && m_st == \old(m_st))) || !(local < token)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((!(t1_pc == 1) || (((__retres1 <= 0 && 0 <= __retres1) && t1_st == \old(t1_st)) && m_st == \old(m_st))) || !(m_pc == 0)) || !(2 <= T1_E)) || !(2 <= \old(m_st))) || !(2 <= E_1)) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((token == local && 2 <= T1_E) && 2 <= E_M) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st) || ((((((2 <= T1_E && 2 <= E_M) && !(0 == t1_st)) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && 1 <= m_pc) && 2 <= E_1) && 2 <= m_st)) || ((((((token == local && 2 <= T1_E) && t1_pc <= 0) && 2 <= E_M) && m_st == 0) && 2 <= E_1) && m_pc == 0)) || ((((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1)) || (((((2 <= T1_E && 2 <= E_M) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || (((((2 <= T1_E && t1_pc <= 0) && 2 <= E_M) && 2 <= E_1) && m_pc == 0) && 2 <= m_st)) || ((((((2 <= T1_E && 2 <= E_M) && m_st == 0) && !(0 == t1_st)) && t1_pc == 1) && 2 <= E_1) && m_pc == 0) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((2 <= T1_E && token <= local + 1) && 2 <= E_M) && !(0 == t1_st)) && local < token) && 1 <= m_pc) && t1_pc == 1) && 2 <= E_1 - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: ((((((token == local && t1_pc <= 0) && 2 == M_E) && T1_E == M_E) && m_st == 0) && E_1 == M_E) && E_M == M_E) && m_pc == 0 RESULT: Ultimate proved your program to be correct! [2021-12-17 15:35:35,668 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