/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:47:51,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:47:51,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:47:51,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:47:51,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:47:51,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:47:51,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:47:51,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:47:51,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:47:51,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:47:51,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:47:51,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:47:51,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:47:51,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:47:51,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:47:51,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:47:51,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:47:51,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:47:51,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:47:51,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:47:51,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:47:51,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:47:51,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:47:51,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:47:51,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:47:51,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:47:51,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:47:51,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:47:51,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:47:51,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:47:51,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:47:51,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:47:51,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:47:51,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:47:51,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:47:51,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:47:51,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:47:51,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:47:51,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:47:51,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:47:51,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:47:51,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:47:51,966 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:47:51,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:47:51,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:47:51,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:47:51,969 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:47:51,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:47:51,969 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:47:51,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:47:51,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:47:51,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:47:51,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:47:51,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:47:51,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:47:51,970 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:47:51,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:47:51,971 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:47:51,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:47:51,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:47:51,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:47:51,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:47:51,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:47:51,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:47:51,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:47:51,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:47:51,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:47:51,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:47:51,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:47:51,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:47:51,974 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:47:51,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:47:52,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:47:52,455 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:47:52,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:47:52,461 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:47:52,461 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:47:52,463 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-09-04 13:47:52,538 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1fea0614/69f1385cf1464bf386284c5a422515fb/FLAG4d59f87ea [2020-09-04 13:47:53,162 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:47:53,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2020-09-04 13:47:53,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1fea0614/69f1385cf1464bf386284c5a422515fb/FLAG4d59f87ea [2020-09-04 13:47:53,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b1fea0614/69f1385cf1464bf386284c5a422515fb [2020-09-04 13:47:53,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:47:53,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:47:53,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:47:53,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:47:53,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:47:53,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:47:53" (1/1) ... [2020-09-04 13:47:53,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc260e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:53, skipping insertion in model container [2020-09-04 13:47:53,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:47:53" (1/1) ... [2020-09-04 13:47:53,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:47:53,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:47:53,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:47:53,859 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:47:53,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:47:54,034 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:47:54,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54 WrapperNode [2020-09-04 13:47:54,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:47:54,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:47:54,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:47:54,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:47:54,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54" (1/1) ... [2020-09-04 13:47:54,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54" (1/1) ... [2020-09-04 13:47:54,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54" (1/1) ... [2020-09-04 13:47:54,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54" (1/1) ... [2020-09-04 13:47:54,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54" (1/1) ... [2020-09-04 13:47:54,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54" (1/1) ... [2020-09-04 13:47:54,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54" (1/1) ... [2020-09-04 13:47:54,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:47:54,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:47:54,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:47:54,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:47:54,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:47:54,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:47:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:47:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 13:47:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-09-04 13:47:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-09-04 13:47:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-09-04 13:47:54,198 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-09-04 13:47:54,199 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-09-04 13:47:54,199 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 13:47:54,199 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 13:47:54,199 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 13:47:54,199 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-09-04 13:47:54,200 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-09-04 13:47:54,200 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-09-04 13:47:54,200 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-09-04 13:47:54,200 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-09-04 13:47:54,201 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-09-04 13:47:54,201 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 13:47:54,201 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 13:47:54,202 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 13:47:54,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:47:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:47:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 13:47:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-09-04 13:47:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-09-04 13:47:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-09-04 13:47:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:47:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-09-04 13:47:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-09-04 13:47:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-09-04 13:47:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 13:47:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 13:47:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 13:47:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-09-04 13:47:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-09-04 13:47:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-09-04 13:47:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-09-04 13:47:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-09-04 13:47:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 13:47:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 13:47:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 13:47:54,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:47:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:47:54,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:47:54,728 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:47:54,729 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-09-04 13:47:54,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:47:54 BoogieIcfgContainer [2020-09-04 13:47:54,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:47:54,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:47:54,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:47:54,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:47:54,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:47:53" (1/3) ... [2020-09-04 13:47:54,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11499d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:47:54, skipping insertion in model container [2020-09-04 13:47:54,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:54" (2/3) ... [2020-09-04 13:47:54,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11499d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:47:54, skipping insertion in model container [2020-09-04 13:47:54,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:47:54" (3/3) ... [2020-09-04 13:47:54,746 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2020-09-04 13:47:54,759 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:47:54,771 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:47:54,795 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:47:54,828 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:47:54,828 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:47:54,828 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:47:54,829 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:47:54,829 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:47:54,829 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:47:54,829 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:47:54,829 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:47:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2020-09-04 13:47:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-04 13:47:54,873 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:54,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:47:54,876 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:54,884 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2020-09-04 13:47:54,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:54,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854138797] [2020-09-04 13:47:54,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:47:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:47:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:47:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:47:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:47:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:47:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:47:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:47:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:47:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:47:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:47:55,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854138797] [2020-09-04 13:47:55,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:47:55,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 13:47:55,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428948498] [2020-09-04 13:47:55,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:47:55,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:47:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:47:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:47:55,625 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 9 states. [2020-09-04 13:47:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:47:58,041 INFO L93 Difference]: Finished difference Result 501 states and 755 transitions. [2020-09-04 13:47:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:47:58,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2020-09-04 13:47:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:47:58,084 INFO L225 Difference]: With dead ends: 501 [2020-09-04 13:47:58,084 INFO L226 Difference]: Without dead ends: 357 [2020-09-04 13:47:58,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:47:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-09-04 13:47:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 244. [2020-09-04 13:47:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-09-04 13:47:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 323 transitions. [2020-09-04 13:47:58,204 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 323 transitions. Word has length 77 [2020-09-04 13:47:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:47:58,205 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 323 transitions. [2020-09-04 13:47:58,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:47:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 323 transitions. [2020-09-04 13:47:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-04 13:47:58,210 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:58,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:47:58,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:47:58,211 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:58,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2125445556, now seen corresponding path program 1 times [2020-09-04 13:47:58,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:58,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827696708] [2020-09-04 13:47:58,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:47:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:47:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:47:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:47:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:47:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:47:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:47:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:47:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:47:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:47:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:47:58,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827696708] [2020-09-04 13:47:58,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:47:58,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:47:58,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557597967] [2020-09-04 13:47:58,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:47:58,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:47:58,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:47:58,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:47:58,473 INFO L87 Difference]: Start difference. First operand 244 states and 323 transitions. Second operand 10 states. [2020-09-04 13:47:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:47:59,864 INFO L93 Difference]: Finished difference Result 573 states and 802 transitions. [2020-09-04 13:47:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:47:59,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-09-04 13:47:59,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:47:59,877 INFO L225 Difference]: With dead ends: 573 [2020-09-04 13:47:59,877 INFO L226 Difference]: Without dead ends: 348 [2020-09-04 13:47:59,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:47:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-09-04 13:47:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 244. [2020-09-04 13:47:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-09-04 13:47:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 316 transitions. [2020-09-04 13:47:59,939 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 316 transitions. Word has length 77 [2020-09-04 13:47:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:47:59,940 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 316 transitions. [2020-09-04 13:47:59,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:47:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2020-09-04 13:47:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-04 13:47:59,942 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:59,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:47:59,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:47:59,943 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash -676620532, now seen corresponding path program 1 times [2020-09-04 13:47:59,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:59,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121886278] [2020-09-04 13:47:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:00,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121886278] [2020-09-04 13:48:00,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:00,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:00,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326785918] [2020-09-04 13:48:00,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:00,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:00,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:00,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:00,182 INFO L87 Difference]: Start difference. First operand 244 states and 316 transitions. Second operand 10 states. [2020-09-04 13:48:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:01,913 INFO L93 Difference]: Finished difference Result 696 states and 1012 transitions. [2020-09-04 13:48:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 13:48:01,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-09-04 13:48:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:01,920 INFO L225 Difference]: With dead ends: 696 [2020-09-04 13:48:01,920 INFO L226 Difference]: Without dead ends: 471 [2020-09-04 13:48:01,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2020-09-04 13:48:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-09-04 13:48:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 296. [2020-09-04 13:48:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-04 13:48:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 369 transitions. [2020-09-04 13:48:01,980 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 369 transitions. Word has length 77 [2020-09-04 13:48:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:01,980 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 369 transitions. [2020-09-04 13:48:01,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 369 transitions. [2020-09-04 13:48:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-04 13:48:01,985 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:01,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:01,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:48:01,986 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:01,989 INFO L82 PathProgramCache]: Analyzing trace with hash 758526605, now seen corresponding path program 1 times [2020-09-04 13:48:01,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:01,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525795602] [2020-09-04 13:48:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:02,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525795602] [2020-09-04 13:48:02,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:02,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:02,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638344173] [2020-09-04 13:48:02,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:02,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:02,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:02,215 INFO L87 Difference]: Start difference. First operand 296 states and 369 transitions. Second operand 10 states. [2020-09-04 13:48:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:03,781 INFO L93 Difference]: Finished difference Result 718 states and 955 transitions. [2020-09-04 13:48:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:48:03,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-09-04 13:48:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:03,790 INFO L225 Difference]: With dead ends: 718 [2020-09-04 13:48:03,791 INFO L226 Difference]: Without dead ends: 442 [2020-09-04 13:48:03,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:48:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-09-04 13:48:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 316. [2020-09-04 13:48:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-09-04 13:48:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 389 transitions. [2020-09-04 13:48:03,869 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 389 transitions. Word has length 77 [2020-09-04 13:48:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:03,869 INFO L479 AbstractCegarLoop]: Abstraction has 316 states and 389 transitions. [2020-09-04 13:48:03,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 389 transitions. [2020-09-04 13:48:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-04 13:48:03,878 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:03,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:03,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:48:03,878 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:03,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash -613280693, now seen corresponding path program 1 times [2020-09-04 13:48:03,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:03,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590027996] [2020-09-04 13:48:03,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:03,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:04,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590027996] [2020-09-04 13:48:04,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:04,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:04,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043600314] [2020-09-04 13:48:04,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:04,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:04,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:04,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:04,189 INFO L87 Difference]: Start difference. First operand 316 states and 389 transitions. Second operand 10 states. [2020-09-04 13:48:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:05,532 INFO L93 Difference]: Finished difference Result 748 states and 981 transitions. [2020-09-04 13:48:05,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 13:48:05,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-09-04 13:48:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:05,537 INFO L225 Difference]: With dead ends: 748 [2020-09-04 13:48:05,537 INFO L226 Difference]: Without dead ends: 452 [2020-09-04 13:48:05,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:48:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-09-04 13:48:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 326. [2020-09-04 13:48:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-09-04 13:48:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 397 transitions. [2020-09-04 13:48:05,578 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 397 transitions. Word has length 77 [2020-09-04 13:48:05,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:05,578 INFO L479 AbstractCegarLoop]: Abstraction has 326 states and 397 transitions. [2020-09-04 13:48:05,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 397 transitions. [2020-09-04 13:48:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-04 13:48:05,580 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:05,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:05,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:48:05,581 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash 88319181, now seen corresponding path program 1 times [2020-09-04 13:48:05,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:05,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60449567] [2020-09-04 13:48:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:05,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60449567] [2020-09-04 13:48:05,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:05,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:48:05,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055513555] [2020-09-04 13:48:05,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:48:05,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:05,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:48:05,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:05,786 INFO L87 Difference]: Start difference. First operand 326 states and 397 transitions. Second operand 10 states. [2020-09-04 13:48:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:07,429 INFO L93 Difference]: Finished difference Result 894 states and 1170 transitions. [2020-09-04 13:48:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 13:48:07,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2020-09-04 13:48:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:07,436 INFO L225 Difference]: With dead ends: 894 [2020-09-04 13:48:07,436 INFO L226 Difference]: Without dead ends: 587 [2020-09-04 13:48:07,439 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:48:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2020-09-04 13:48:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 362. [2020-09-04 13:48:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-09-04 13:48:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 422 transitions. [2020-09-04 13:48:07,489 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 422 transitions. Word has length 77 [2020-09-04 13:48:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:07,490 INFO L479 AbstractCegarLoop]: Abstraction has 362 states and 422 transitions. [2020-09-04 13:48:07,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:48:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 422 transitions. [2020-09-04 13:48:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-04 13:48:07,492 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:07,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:07,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:48:07,493 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2020-09-04 13:48:07,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:07,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030917640] [2020-09-04 13:48:07,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:48:07,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030917640] [2020-09-04 13:48:07,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:48:07,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 13:48:07,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469198962] [2020-09-04 13:48:07,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:48:07,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:07,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:48:07,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:48:07,672 INFO L87 Difference]: Start difference. First operand 362 states and 422 transitions. Second operand 7 states. [2020-09-04 13:48:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:09,033 INFO L93 Difference]: Finished difference Result 1180 states and 1487 transitions. [2020-09-04 13:48:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:48:09,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-09-04 13:48:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:09,042 INFO L225 Difference]: With dead ends: 1180 [2020-09-04 13:48:09,042 INFO L226 Difference]: Without dead ends: 838 [2020-09-04 13:48:09,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:48:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-09-04 13:48:09,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 736. [2020-09-04 13:48:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-09-04 13:48:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 896 transitions. [2020-09-04 13:48:09,127 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 896 transitions. Word has length 77 [2020-09-04 13:48:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:09,128 INFO L479 AbstractCegarLoop]: Abstraction has 736 states and 896 transitions. [2020-09-04 13:48:09,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:48:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 896 transitions. [2020-09-04 13:48:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-04 13:48:09,130 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:09,131 INFO L422 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:09,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:48:09,131 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:09,132 INFO L82 PathProgramCache]: Analyzing trace with hash -208124888, now seen corresponding path program 1 times [2020-09-04 13:48:09,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:09,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165142792] [2020-09-04 13:48:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:48:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:48:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,379 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-04 13:48:09,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165142792] [2020-09-04 13:48:09,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260465495] [2020-09-04 13:48:09,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:09,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:48:09,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 13:48:09,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:09,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-09-04 13:48:09,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219570122] [2020-09-04 13:48:09,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:09,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:09,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:09,570 INFO L87 Difference]: Start difference. First operand 736 states and 896 transitions. Second operand 3 states. [2020-09-04 13:48:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:09,743 INFO L93 Difference]: Finished difference Result 2007 states and 2500 transitions. [2020-09-04 13:48:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:09,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-09-04 13:48:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:09,752 INFO L225 Difference]: With dead ends: 2007 [2020-09-04 13:48:09,752 INFO L226 Difference]: Without dead ends: 1018 [2020-09-04 13:48:09,757 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-09-04 13:48:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2020-09-04 13:48:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2020-09-04 13:48:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1236 transitions. [2020-09-04 13:48:09,848 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1236 transitions. Word has length 121 [2020-09-04 13:48:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:09,848 INFO L479 AbstractCegarLoop]: Abstraction has 1018 states and 1236 transitions. [2020-09-04 13:48:09,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1236 transitions. [2020-09-04 13:48:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-09-04 13:48:09,852 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:09,852 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:10,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-09-04 13:48:10,065 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:10,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:10,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1360925018, now seen corresponding path program 1 times [2020-09-04 13:48:10,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:10,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294975195] [2020-09-04 13:48:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:48:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:48:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2020-09-04 13:48:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2020-09-04 13:48:10,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294975195] [2020-09-04 13:48:10,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333800252] [2020-09-04 13:48:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:10,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2020-09-04 13:48:10,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 13:48:10,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:10,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-09-04 13:48:10,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235767884] [2020-09-04 13:48:10,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:10,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:10,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:10,543 INFO L87 Difference]: Start difference. First operand 1018 states and 1236 transitions. Second operand 3 states. [2020-09-04 13:48:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:10,717 INFO L93 Difference]: Finished difference Result 2446 states and 3135 transitions. [2020-09-04 13:48:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:10,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-09-04 13:48:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:10,753 INFO L225 Difference]: With dead ends: 2446 [2020-09-04 13:48:10,753 INFO L226 Difference]: Without dead ends: 1449 [2020-09-04 13:48:10,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-09-04 13:48:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1443. [2020-09-04 13:48:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2020-09-04 13:48:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1735 transitions. [2020-09-04 13:48:10,897 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1735 transitions. Word has length 156 [2020-09-04 13:48:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:10,898 INFO L479 AbstractCegarLoop]: Abstraction has 1443 states and 1735 transitions. [2020-09-04 13:48:10,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1735 transitions. [2020-09-04 13:48:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-09-04 13:48:10,902 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:10,903 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:11,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:11,118 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:11,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:11,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1238354593, now seen corresponding path program 1 times [2020-09-04 13:48:11,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:11,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870470185] [2020-09-04 13:48:11,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:48:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:48:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2020-09-04 13:48:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-09-04 13:48:11,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870470185] [2020-09-04 13:48:11,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861905898] [2020-09-04 13:48:11,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:11,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 10 conjunts are in the unsatisfiable core [2020-09-04 13:48:11,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 13 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 13:48:11,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:48:11,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2020-09-04 13:48:11,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156101560] [2020-09-04 13:48:11,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:48:11,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:11,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:48:11,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:48:11,901 INFO L87 Difference]: Start difference. First operand 1443 states and 1735 transitions. Second operand 14 states. [2020-09-04 13:48:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:14,302 INFO L93 Difference]: Finished difference Result 2733 states and 3367 transitions. [2020-09-04 13:48:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 13:48:14,303 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 157 [2020-09-04 13:48:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:14,318 INFO L225 Difference]: With dead ends: 2733 [2020-09-04 13:48:14,318 INFO L226 Difference]: Without dead ends: 1765 [2020-09-04 13:48:14,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2020-09-04 13:48:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2020-09-04 13:48:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1598. [2020-09-04 13:48:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2020-09-04 13:48:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 1910 transitions. [2020-09-04 13:48:14,489 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 1910 transitions. Word has length 157 [2020-09-04 13:48:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:14,490 INFO L479 AbstractCegarLoop]: Abstraction has 1598 states and 1910 transitions. [2020-09-04 13:48:14,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:48:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1910 transitions. [2020-09-04 13:48:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-09-04 13:48:14,496 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:14,496 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:14,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-09-04 13:48:14,711 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:14,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:14,713 INFO L82 PathProgramCache]: Analyzing trace with hash 846884099, now seen corresponding path program 1 times [2020-09-04 13:48:14,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:14,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625135024] [2020-09-04 13:48:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-09-04 13:48:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-09-04 13:48:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-09-04 13:48:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-04 13:48:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2020-09-04 13:48:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-09-04 13:48:14,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625135024] [2020-09-04 13:48:14,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707375760] [2020-09-04 13:48:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 3 conjunts are in the unsatisfiable core [2020-09-04 13:48:15,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-09-04 13:48:15,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:15,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-09-04 13:48:15,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693280917] [2020-09-04 13:48:15,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:15,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:15,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:15,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:48:15,128 INFO L87 Difference]: Start difference. First operand 1598 states and 1910 transitions. Second operand 3 states. [2020-09-04 13:48:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:15,324 INFO L93 Difference]: Finished difference Result 3165 states and 3848 transitions. [2020-09-04 13:48:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:15,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2020-09-04 13:48:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:15,335 INFO L225 Difference]: With dead ends: 3165 [2020-09-04 13:48:15,335 INFO L226 Difference]: Without dead ends: 1588 [2020-09-04 13:48:15,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:48:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2020-09-04 13:48:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1588. [2020-09-04 13:48:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-09-04 13:48:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1864 transitions. [2020-09-04 13:48:15,483 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1864 transitions. Word has length 175 [2020-09-04 13:48:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:15,484 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 1864 transitions. [2020-09-04 13:48:15,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1864 transitions. [2020-09-04 13:48:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-09-04 13:48:15,489 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:15,489 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:15,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:15,703 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:15,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:15,704 INFO L82 PathProgramCache]: Analyzing trace with hash -797989467, now seen corresponding path program 1 times [2020-09-04 13:48:15,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:15,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083578679] [2020-09-04 13:48:15,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-09-04 13:48:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:48:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 13:48:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-09-04 13:48:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-09-04 13:48:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-09-04 13:48:15,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083578679] [2020-09-04 13:48:15,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605217833] [2020-09-04 13:48:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:16,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2020-09-04 13:48:16,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 13:48:16,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-04 13:48:16,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-09-04 13:48:16,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108237703] [2020-09-04 13:48:16,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:48:16,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:16,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:48:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:16,183 INFO L87 Difference]: Start difference. First operand 1588 states and 1864 transitions. Second operand 3 states. [2020-09-04 13:48:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:16,456 INFO L93 Difference]: Finished difference Result 3618 states and 4277 transitions. [2020-09-04 13:48:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:48:16,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-09-04 13:48:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:16,465 INFO L225 Difference]: With dead ends: 3618 [2020-09-04 13:48:16,466 INFO L226 Difference]: Without dead ends: 1034 [2020-09-04 13:48:16,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:48:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2020-09-04 13:48:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2020-09-04 13:48:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2020-09-04 13:48:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1176 transitions. [2020-09-04 13:48:16,567 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1176 transitions. Word has length 176 [2020-09-04 13:48:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:16,567 INFO L479 AbstractCegarLoop]: Abstraction has 1034 states and 1176 transitions. [2020-09-04 13:48:16,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:48:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1176 transitions. [2020-09-04 13:48:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-09-04 13:48:16,571 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:48:16,572 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:48:16,787 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-09-04 13:48:16,787 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:48:16,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:48:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2020-09-04 13:48:16,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:48:16,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115403893] [2020-09-04 13:48:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:48:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:16,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:16,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:48:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:16,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:48:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-09-04 13:48:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-09-04 13:48:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 13:48:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 13:48:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-09-04 13:48:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-09-04 13:48:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-09-04 13:48:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 13:48:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2020-09-04 13:48:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:48:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:48:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:48:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:48:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2020-09-04 13:48:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2020-09-04 13:48:17,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115403893] [2020-09-04 13:48:17,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695330607] [2020-09-04 13:48:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:48:17,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 17 conjunts are in the unsatisfiable core [2020-09-04 13:48:17,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:48:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-09-04 13:48:17,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:48:17,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 12 [2020-09-04 13:48:17,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514461597] [2020-09-04 13:48:17,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:48:17,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:48:17,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:48:17,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:48:17,576 INFO L87 Difference]: Start difference. First operand 1034 states and 1176 transitions. Second operand 12 states. [2020-09-04 13:48:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:48:20,464 INFO L93 Difference]: Finished difference Result 1268 states and 1468 transitions. [2020-09-04 13:48:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 13:48:20,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 176 [2020-09-04 13:48:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:48:20,466 INFO L225 Difference]: With dead ends: 1268 [2020-09-04 13:48:20,466 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:48:20,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-09-04 13:48:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:48:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:48:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:48:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:48:20,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2020-09-04 13:48:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:48:20,472 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:48:20,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:48:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:48:20,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:48:20,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:48:20,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:48:23,187 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-09-04 13:48:23,463 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-09-04 13:48:23,763 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-09-04 13:48:24,007 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-09-04 13:48:24,258 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-09-04 13:48:24,548 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2020-09-04 13:48:24,670 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2020-09-04 13:48:25,161 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2020-09-04 13:48:25,376 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2020-09-04 13:48:25,593 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-09-04 13:48:26,251 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2020-09-04 13:48:26,408 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-09-04 13:48:26,567 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2020-09-04 13:48:26,752 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2020-09-04 13:48:27,383 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2020-09-04 13:48:27,738 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2020-09-04 13:48:27,937 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2020-09-04 13:48:28,238 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2020-09-04 13:48:28,501 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2020-09-04 13:48:29,031 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2020-09-04 13:48:29,218 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2020-09-04 13:48:30,910 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2020-09-04 13:48:31,089 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2020-09-04 13:48:31,448 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2020-09-04 13:48:32,433 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2020-09-04 13:48:37,763 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-09-04 13:48:37,881 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:38,058 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-09-04 13:48:38,179 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:38,296 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:38,414 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:38,621 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2020-09-04 13:48:38,739 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:38,859 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:39,019 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-09-04 13:48:39,229 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:39,437 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:39,568 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:39,686 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:39,803 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:40,025 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2020-09-04 13:48:40,191 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2020-09-04 13:48:40,311 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:40,508 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-09-04 13:48:40,628 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:40,781 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-09-04 13:48:41,000 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2020-09-04 13:48:41,228 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2020-09-04 13:48:41,346 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:41,463 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:41,580 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:41,700 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:41,907 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:42,029 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:42,149 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:42,269 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:42,387 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:42,546 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-09-04 13:48:42,749 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:42,871 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:43,084 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-09-04 13:48:43,241 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2020-09-04 13:48:43,358 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:43,528 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2020-09-04 13:48:43,649 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:43,877 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2020-09-04 13:48:44,042 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2020-09-04 13:48:44,168 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:44,369 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-09-04 13:48:44,486 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:44,607 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:44,725 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:44,845 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:45,021 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2020-09-04 13:48:45,192 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2020-09-04 13:48:45,313 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:45,430 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:45,550 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:45,671 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:45,788 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:47,145 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:47,322 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-09-04 13:48:47,442 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:47,560 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:47,678 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:47,885 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2020-09-04 13:48:48,003 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:48,123 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:48,280 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-09-04 13:48:48,487 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:48,695 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:48,812 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:48,930 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:49,047 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:49,269 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2020-09-04 13:48:49,436 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2020-09-04 13:48:49,556 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:49,753 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-09-04 13:48:49,874 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:50,027 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-09-04 13:48:50,246 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2020-09-04 13:48:50,474 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2020-09-04 13:48:50,594 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:50,724 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:50,843 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:50,963 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:51,170 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:51,289 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:51,410 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:51,529 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:51,647 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:51,806 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-09-04 13:48:52,009 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:52,129 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:52,330 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-09-04 13:48:52,486 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2020-09-04 13:48:52,603 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:52,773 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2020-09-04 13:48:52,893 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:53,121 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2020-09-04 13:48:53,285 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2020-09-04 13:48:53,405 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:53,605 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-09-04 13:48:53,723 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:53,843 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:53,961 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:54,081 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:54,272 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2020-09-04 13:48:54,447 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2020-09-04 13:48:54,568 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:54,685 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:54,806 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:54,926 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:55,044 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:55,576 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-09-04 13:48:55,694 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:55,872 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-09-04 13:48:55,992 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:56,109 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:56,227 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:56,433 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2020-09-04 13:48:56,550 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:56,670 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:56,826 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-09-04 13:48:57,034 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:57,241 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:57,358 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:57,475 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:57,593 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:57,812 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2020-09-04 13:48:57,978 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2020-09-04 13:48:58,100 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:58,308 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-09-04 13:48:58,428 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:58,580 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-09-04 13:48:58,799 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2020-09-04 13:48:59,026 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2020-09-04 13:48:59,144 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:59,261 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:59,378 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:48:59,500 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:59,707 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:48:59,827 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:48:59,947 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:00,069 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:00,187 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:49:00,345 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2020-09-04 13:49:00,546 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-09-04 13:49:00,669 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:00,870 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-09-04 13:49:01,025 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2020-09-04 13:49:01,142 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:49:01,312 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2020-09-04 13:49:01,432 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:01,659 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2020-09-04 13:49:01,836 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2020-09-04 13:49:01,956 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:02,157 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2020-09-04 13:49:02,274 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:49:02,394 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:02,511 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:49:02,633 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:02,809 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2020-09-04 13:49:02,982 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2020-09-04 13:49:03,103 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:03,220 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:49:03,340 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:03,460 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-09-04 13:49:03,577 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:49:09,215 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:09,383 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2020-09-04 13:49:09,549 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2020-09-04 13:49:09,681 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-09-04 13:49:09,794 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:09,914 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:10,022 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:10,188 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2020-09-04 13:49:10,300 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:10,411 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:10,523 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:10,652 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2020-09-04 13:49:10,760 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:10,925 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2020-09-04 13:49:11,034 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:11,163 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2020-09-04 13:49:11,273 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:11,403 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-09-04 13:49:11,517 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:11,628 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:11,741 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:11,849 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:11,960 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:12,068 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:12,197 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2020-09-04 13:49:12,324 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2020-09-04 13:49:12,455 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2020-09-04 13:49:12,620 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2020-09-04 13:49:12,729 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:12,841 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:12,967 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:13,099 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2020-09-04 13:49:13,234 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2020-09-04 13:49:13,343 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-09-04 13:49:13,509 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2020-09-04 13:49:13,620 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:13,733 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-09-04 13:49:13,863 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2020-09-04 13:49:14,250 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-09-04 13:49:20,216 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2020-09-04 13:49:21,503 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 131 DAG size of output: 55 [2020-09-04 13:49:22,020 WARN L193 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-09-04 13:49:22,664 WARN L193 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2020-09-04 13:49:23,344 WARN L193 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2020-09-04 13:49:23,520 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2020-09-04 13:49:24,168 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2020-09-04 13:49:24,812 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2020-09-04 13:49:24,961 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-09-04 13:49:25,623 WARN L193 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2020-09-04 13:49:27,071 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 157 DAG size of output: 84 [2020-09-04 13:49:27,251 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-09-04 13:49:27,780 WARN L193 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2020-09-04 13:49:29,165 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 168 DAG size of output: 59 [2020-09-04 13:49:29,681 WARN L193 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-09-04 13:49:30,493 WARN L193 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 59 [2020-09-04 13:49:30,604 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2020-09-04 13:49:32,151 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 137 DAG size of output: 80 [2020-09-04 13:49:32,987 WARN L193 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-09-04 13:49:33,641 WARN L193 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2020-09-04 13:49:36,296 WARN L193 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 197 DAG size of output: 100 [2020-09-04 13:49:36,639 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-09-04 13:49:37,313 WARN L193 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 53 [2020-09-04 13:49:37,683 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-09-04 13:49:40,344 WARN L193 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 197 DAG size of output: 100 [2020-09-04 13:49:40,816 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2020-09-04 13:49:41,481 WARN L193 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2020-09-04 13:49:44,152 WARN L193 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 197 DAG size of output: 100 [2020-09-04 13:49:44,280 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-09-04 13:49:44,423 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-09-04 13:49:44,782 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-09-04 13:49:45,629 WARN L193 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 58 [2020-09-04 13:49:46,068 WARN L193 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-09-04 13:49:46,493 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 59 [2020-09-04 13:49:46,983 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-09-04 13:49:48,082 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2020-09-04 13:49:48,469 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2020-09-04 13:49:49,481 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 155 DAG size of output: 63 [2020-09-04 13:49:50,264 WARN L193 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2020-09-04 13:49:50,939 WARN L193 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2020-09-04 13:49:51,195 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2020-09-04 13:49:52,023 WARN L193 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 59 [2020-09-04 13:49:52,749 WARN L193 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-09-04 13:49:53,449 WARN L193 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2020-09-04 13:49:53,905 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2020-09-04 13:49:54,030 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-09-04 13:49:54,346 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-09-04 13:49:54,481 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-09-04 13:49:54,961 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2020-09-04 13:49:55,086 INFO L268 CegarLoopResult]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2020-09-04 13:49:55,086 INFO L264 CegarLoopResult]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 0)) (.cse1 (not (<= 2 ~E_M~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= ~m_st~0 |old(~m_st~0)|) (= |old(~t1_st~0)| ~t1_st~0))) (.cse4 (= ~M_E~0 0)) (.cse5 (= ~m_pc~0 1)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (not (<= ~t1_pc~0 0)) .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ ~local~0 1))) (or .cse6 (not (<= ~token~0 .cse7)) .cse2 (not (<= .cse7 ~token~0)) .cse3 .cse4 .cse8 .cse9)) (or .cse0 .cse1 .cse6 .cse2 (not (<= 2 |old(~t1_st~0)|)) (not (<= ~token~0 ~local~0)) .cse3 .cse4 (not (<= ~local~0 ~token~0))) (or .cse2 .cse3 .cse4 .cse5 .cse8 .cse9))) [2020-09-04 13:49:55,086 INFO L268 CegarLoopResult]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2020-09-04 13:49:55,087 INFO L264 CegarLoopResult]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse8 (= ~M_E~0 0)) (.cse21 (= ~m_pc~0 1))) (let ((.cse13 (<= 2 ~T1_E~0)) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (not .cse21)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (not .cse8)) (.cse16 (<= 2 ~E_M~0)) (.cse4 (= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse9 (and .cse13 .cse2 .cse18 .cse14 .cse15 .cse16 .cse4)) (.cse10 (not (<= 2 |old(~m_st~0)|))) (.cse12 (not (<= |old(~token~0)| ~local~0))) (.cse20 (= ~m_st~0 0)) (.cse3 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse6 (= |old(~token~0)| ~token~0)) (.cse0 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not .cse13)) (.cse7 (not (<= 2 |old(~E_M~0)|))) (.cse17 (not (<= ~local~0 |old(~token~0)|))) (.cse11 (not .cse14))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 (not (= |old(~t1_pc~0)| 1)) .cse1 .cse7 (and .cse13 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4) .cse17 .cse8 .cse18 .cse10 (let ((.cse19 (+ |old(~token~0)| 1))) (and .cse13 (<= .cse19 ~token~0) (<= ~token~0 .cse19) .cse14 .cse15 .cse20 .cse3 .cse16)) .cse11) (or .cse1 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11) (or .cse12 (and .cse20 .cse3 .cse4 .cse5 .cse6) .cse0 .cse1 (not (= |old(~m_st~0)| 0)) .cse7 .cse17 .cse8 .cse21 .cse11))))) [2020-09-04 13:49:55,087 INFO L268 CegarLoopResult]: For program point L81(lines 81 85) no Hoare annotation was computed. [2020-09-04 13:49:55,088 INFO L264 CegarLoopResult]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= |old(~token~0)| ~token~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse1 (and .cse13 .cse10 .cse11 .cse14 .cse12)) (.cse7 (not (<= |old(~t1_pc~0)| 0))) (.cse4 (= ~m_pc~0 1)) (.cse8 (not (<= |old(~token~0)| ~local~0))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse2 (not (<= 2 |old(~E_M~0)|))) (.cse9 (not (<= ~local~0 |old(~token~0)|))) (.cse3 (= ~M_E~0 0)) (.cse5 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (or .cse8 .cse7 .cse0 (not (= |old(~m_st~0)| 0)) .cse2 .cse9 .cse3 .cse4 (and (<= ~token~0 ~local~0) (= ~m_st~0 0) .cse10 (<= ~local~0 ~token~0) .cse11 .cse12) .cse6) (or .cse8 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse2 .cse9 .cse3 .cse5 .cse6 (and .cse13 (= ~t1_pc~0 1) .cse11 .cse12 .cse14))))) [2020-09-04 13:49:55,088 INFO L268 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2020-09-04 13:49:55,089 INFO L264 CegarLoopResult]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (not (<= |old(~token~0)| ~local~0))) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse6 (= ~m_pc~0 1)) (.cse11 (not (<= |old(~t1_pc~0)| 0))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse5 (= ~M_E~0 0)) (.cse7 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (<= 2 ~E_1~0)))) (and (or .cse0 (and .cse1 (= |old(~t1_pc~0)| ~t1_pc~0) .cse2 (= |old(~token~0)| ~token~0) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 (and .cse1 (= ~t1_pc~0 1) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse2 .cse3) (not (= |old(~t1_pc~0)| 1)) .cse0 .cse4 .cse10 .cse5 .cse7 .cse8) (or .cse9 .cse11 .cse0 (not (= |old(~m_st~0)| 0)) .cse4 .cse10 .cse5 .cse6 .cse8) (or .cse11 .cse0 .cse4 .cse5 .cse7 .cse8))) [2020-09-04 13:49:55,089 INFO L268 CegarLoopResult]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2020-09-04 13:49:55,089 INFO L264 CegarLoopResult]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse14 (<= 2 ~m_st~0)) (.cse10 (= ~m_pc~0 1)) (.cse9 (= ~M_E~0 0)) (.cse13 (<= 2 ~E_M~0))) (let ((.cse0 (not (<= |old(~token~0)| ~local~0))) (.cse5 (= ~m_st~0 0)) (.cse8 (not (<= ~local~0 |old(~token~0)|))) (.cse1 (not (<= |old(~t1_pc~0)| 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse7 (not (<= 2 |old(~E_M~0)|))) (.cse15 (and .cse14 (not .cse10) (not .cse9) .cse13)) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse11 (not (<= 2 ~E_1~0))) (.cse3 (<= 2 ~t1_st~0)) (.cse4 (= ~t1_pc~0 1)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 (not (= |old(~m_st~0)| 0)) (and .cse3 .cse4 .cse5 .cse6 (= |old(~token~0)| ~token~0)) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (not (= |old(~t1_pc~0)| 1)) .cse2 (let ((.cse12 (+ |old(~token~0)| 1))) (and .cse3 .cse4 (<= .cse12 ~token~0) (<= ~token~0 .cse12) .cse5 .cse13)) .cse7 .cse8 .cse9 (and .cse3 .cse14 (= |old(~t1_pc~0)| ~t1_pc~0) .cse13) .cse15 .cse16 .cse11) (or .cse2 .cse7 .cse9 .cse10 .cse15 .cse16 .cse11) (or .cse1 .cse2 .cse7 .cse9 .cse15 .cse16 .cse11 (and .cse3 .cse14 .cse4 .cse6))))) [2020-09-04 13:49:55,089 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse5 (= ~m_pc~0 1)) (.cse9 (not (<= |old(~t1_pc~0)| 0))) (.cse8 (not (<= |old(~token~0)| ~local~0))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse1 (not (<= 2 |old(~E_M~0)|))) (.cse10 (not (<= ~local~0 |old(~token~0)|))) (.cse4 (= ~M_E~0 0)) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse3 (= |old(~t1_st~0)| ~t1_st~0)) (.cse6 (not (<= 2 |old(~m_st~0)|))) (.cse7 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse0 (not (= |old(~m_st~0)| 0)) .cse1 .cse10 .cse4 .cse5 .cse7) (or .cse9 .cse0 .cse1 .cse4 .cse6 .cse7) (or .cse8 (not (= |old(~t1_pc~0)| 1)) .cse0 .cse1 .cse10 .cse4 (let ((.cse11 (+ |old(~token~0)| 1))) (and .cse2 (= ~t1_pc~0 1) (<= .cse11 ~token~0) (<= ~token~0 .cse11) .cse3)) .cse6 .cse7))) [2020-09-04 13:49:55,089 INFO L268 CegarLoopResult]: For program point L99-1(line 99) no Hoare annotation was computed. [2020-09-04 13:49:55,090 INFO L268 CegarLoopResult]: For program point L317(lines 317 321) no Hoare annotation was computed. [2020-09-04 13:49:55,090 INFO L268 CegarLoopResult]: For program point L315(line 315) no Hoare annotation was computed. [2020-09-04 13:49:55,090 INFO L268 CegarLoopResult]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2020-09-04 13:49:55,090 INFO L268 CegarLoopResult]: For program point L309(lines 309 313) no Hoare annotation was computed. [2020-09-04 13:49:55,090 INFO L264 CegarLoopResult]: At program point L307(line 307) the Hoare annotation is: (let ((.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (+ ~local~0 1))) (let ((.cse11 (not (<= ~token~0 .cse16))) (.cse12 (not (<= .cse16 ~token~0))) (.cse0 (= ~E_1~0 0)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= ~t1_pc~0 0))) (.cse6 (= ~m_pc~0 1)) (.cse1 (not (<= 2 ~E_M~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse4 (and (= ~m_st~0 |old(~m_st~0)|) .cse13)) (.cse5 (= ~M_E~0 0)) (.cse15 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9 .cse10) (or .cse7 .cse11 .cse3 .cse12 .cse4 .cse5 .cse9 .cse10) (or .cse1 .cse7 .cse11 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 .cse12 (and (= ~m_st~0 0) .cse13) .cse5 .cse10) (or .cse0 .cse1 .cse7 .cse3 .cse8 .cse14 .cse4 .cse5 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10) (or .cse3 .cse4 .cse5 .cse6 .cse9 .cse10) (or .cse1 .cse7 .cse3 .cse14 .cse4 .cse5 .cse15 .cse9 .cse10)))) [2020-09-04 13:49:55,091 INFO L264 CegarLoopResult]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (+ ~local~0 1))) (let ((.cse0 (= ~E_1~0 0)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= ~t1_pc~0 0))) (.cse6 (= ~m_pc~0 1)) (.cse1 (not (<= 2 ~E_M~0))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse11 (not (<= ~token~0 .cse17))) (.cse13 (= ~m_st~0 0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse12 (not (<= .cse17 ~token~0))) (.cse4 (and (= ~m_st~0 |old(~m_st~0)|) .cse14)) (.cse5 (= ~M_E~0 0)) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9 .cse10) (or .cse1 .cse7 .cse11 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 .cse12 (and .cse13 .cse14) .cse5 .cse10) (or .cse0 .cse1 .cse7 .cse3 .cse8 .cse15 .cse4 .cse5 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10) (or .cse3 .cse4 .cse5 .cse6 .cse9 .cse10) (or .cse1 .cse7 .cse3 .cse15 .cse4 .cse5 .cse16 .cse9 .cse10) (or .cse7 .cse11 (and (= ~E_M~0 1) .cse13) .cse3 .cse12 .cse4 .cse5 .cse9 .cse10)))) [2020-09-04 13:49:55,091 INFO L268 CegarLoopResult]: For program point L307-1(line 307) no Hoare annotation was computed. [2020-09-04 13:49:55,091 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (+ ~local~0 1))) (let ((.cse11 (not (<= ~token~0 .cse16))) (.cse12 (not (<= .cse16 ~token~0))) (.cse0 (= ~E_1~0 0)) (.cse8 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= ~t1_pc~0 0))) (.cse6 (= ~m_pc~0 1)) (.cse1 (not (<= 2 ~E_M~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse14 (not (<= ~token~0 ~local~0))) (.cse4 (and (= ~m_st~0 |old(~m_st~0)|) .cse13)) (.cse5 (= ~M_E~0 0)) (.cse15 (not (<= ~local~0 ~token~0))) (.cse9 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9 .cse10) (or .cse7 .cse11 .cse3 .cse12 .cse4 .cse5 .cse9 .cse10) (or .cse1 .cse7 .cse11 .cse3 (not (= |old(~m_st~0)| 0)) .cse8 .cse12 (and (= ~m_st~0 0) .cse13) .cse5 .cse10) (or .cse0 .cse1 .cse7 .cse3 .cse8 .cse14 .cse4 .cse5 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10) (or .cse3 .cse4 .cse5 .cse6 .cse9 .cse10) (or .cse1 .cse7 .cse3 .cse14 .cse4 .cse5 .cse15 .cse9 .cse10)))) [2020-09-04 13:49:55,091 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2020-09-04 13:49:55,091 INFO L271 CegarLoopResult]: At program point L190(lines 177 192) the Hoare annotation is: true [2020-09-04 13:49:55,091 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2020-09-04 13:49:55,091 INFO L268 CegarLoopResult]: For program point L182(lines 182 187) no Hoare annotation was computed. [2020-09-04 13:49:55,092 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2020-09-04 13:49:55,092 INFO L268 CegarLoopResult]: For program point L178(lines 178 188) no Hoare annotation was computed. [2020-09-04 13:49:55,092 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2020-09-04 13:49:55,092 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2020-09-04 13:49:55,092 INFO L271 CegarLoopResult]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2020-09-04 13:49:55,092 INFO L268 CegarLoopResult]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2020-09-04 13:49:55,092 INFO L264 CegarLoopResult]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse2 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= 2 ~E_M~0))) (.cse7 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse1 (not (<= 2 ~m_st~0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (and (<= 0 is_transmit1_triggered_~__retres1~1) (<= is_transmit1_triggered_~__retres1~1 0))) (.cse5 (= ~M_E~0 0)) (.cse6 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~E_1~0 0) .cse0 .cse2 .cse3 .cse4 .cse5 .cse7) (or .cse1 .cse3 .cse4 .cse7 .cse5 .cse6) (or .cse0 .cse8 .cse3 .cse4 (not (<= ~token~0 ~local~0)) .cse5 .cse7 (not (<= 2 ~t1_st~0)) .cse9 (not (<= ~local~0 ~token~0)) .cse6) (let ((.cse10 (+ ~local~0 1))) (or .cse8 (not (<= ~token~0 .cse10)) .cse3 .cse4 (not (<= .cse10 ~token~0)) .cse5 .cse9 .cse6)) (or .cse1 .cse8 .cse3 .cse4 .cse5 .cse6))) [2020-09-04 13:49:55,092 INFO L268 CegarLoopResult]: For program point L134(lines 134 139) no Hoare annotation was computed. [2020-09-04 13:49:55,093 INFO L268 CegarLoopResult]: For program point L133(lines 133 142) no Hoare annotation was computed. [2020-09-04 13:49:55,093 INFO L268 CegarLoopResult]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2020-09-04 13:49:55,093 INFO L268 CegarLoopResult]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2020-09-04 13:49:55,093 INFO L268 CegarLoopResult]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2020-09-04 13:49:55,093 INFO L268 CegarLoopResult]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2020-09-04 13:49:55,093 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse7 (not (<= ~t1_pc~0 0))) (.cse12 (not (<= ~token~0 ~local~0))) (.cse6 (= ~m_pc~0 1)) (.cse11 (not (= ~m_st~0 0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse0 (= |old(~M_E~0)| 0)) (.cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse2 (not (<= 2 ~m_st~0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse10 (not (<= 2 ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse8 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse3 .cse4 .cse5 .cse10 .cse11)) (or .cse0 .cse1 .cse2 .cse8 .cse12 .cse3 .cse4 .cse5 .cse13) (or .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11) (or .cse0 .cse1 .cse7 .cse12 .cse3 .cse4 .cse5 .cse6 .cse11 .cse13) (or .cse0 .cse1 .cse8 .cse12 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11 .cse13) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse10))) [2020-09-04 13:49:55,094 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2020-09-04 13:49:55,094 INFO L268 CegarLoopResult]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2020-09-04 13:49:55,094 INFO L268 CegarLoopResult]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2020-09-04 13:49:55,094 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2020-09-04 13:49:55,094 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (<= 2 ~E_M~0)) (not (<= ~t1_pc~0 0)) (not (<= 2 ~T1_E~0)) (not (= |old(~m_st~0)| 0)) (not (<= ~token~0 ~local~0)) (and (= ~m_st~0 0) (= |old(~t1_st~0)| ~t1_st~0)) (= ~m_pc~0 1) (not (<= 2 ~M_E~0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-09-04 13:49:55,094 INFO L268 CegarLoopResult]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2020-09-04 13:49:55,094 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (and (<= ~token~0 ~local~0) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (<= ~local~0 ~token~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-09-04 13:49:55,094 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2020-09-04 13:49:55,095 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2020-09-04 13:49:55,095 INFO L268 CegarLoopResult]: For program point L468(line 468) no Hoare annotation was computed. [2020-09-04 13:49:55,095 INFO L264 CegarLoopResult]: At program point L467(line 467) the Hoare annotation is: (or (and (<= ~token~0 ~local~0) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (= |old(~m_i~0)| ~m_i~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (<= ~local~0 ~token~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|))) [2020-09-04 13:49:55,095 INFO L264 CegarLoopResult]: At program point L467-1(line 467) the Hoare annotation is: (or (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (<= ~local~0 ~token~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|))) [2020-09-04 13:49:55,095 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2020-09-04 13:49:55,096 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2020-09-04 13:49:55,096 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2020-09-04 13:49:55,096 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2020-09-04 13:49:55,096 INFO L268 CegarLoopResult]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2020-09-04 13:49:55,096 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-09-04 13:49:55,096 INFO L264 CegarLoopResult]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse9 (+ |old(~local~0)| 1))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (<= 2 ~E_M~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= |old(~token~0)| .cse9))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= ~M_E~0 0)) (.cse8 (not (<= .cse9 |old(~token~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (<= ~t1_pc~0 0)) .cse2 .cse3 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~local~0)| |old(~token~0)|)) .cse5 (not (<= |old(~token~0)| |old(~local~0)|)) .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (and (= ~local~0 |old(~local~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0)) .cse8)))) [2020-09-04 13:49:55,097 INFO L264 CegarLoopResult]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse7 (= ~M_E~0 0))) (let ((.cse13 (<= 2 ~t1_st~0)) (.cse4 (<= 2 ~m_st~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse16 (= ~t1_pc~0 1)) (.cse5 (<= 2 ~E_1~0)) (.cse17 (not .cse7)) (.cse15 (<= 2 ~E_M~0))) (let ((.cse8 (and .cse4 .cse14 .cse16 (<= ~token~0 ~local~0) .cse5 .cse17 (<= ~local~0 ~token~0) .cse15)) (.cse9 (not .cse16)) (.cse12 (and .cse13 .cse4 .cse14 .cse16 .cse5 .cse17 .cse15)) (.cse0 (not .cse15)) (.cse1 (not (<= ~t1_pc~0 0))) (.cse2 (not .cse14)) (.cse3 (= |old(~m_pc~0)| 1)) (.cse11 (not (<= 2 |old(~t1_st~0)|))) (.cse6 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse8 .cse0 .cse9 .cse2 (not (<= |old(~token~0)| .cse10)) .cse11 .cse6 .cse7 .cse12 (not (<= .cse10 |old(~token~0)|)))) (or .cse8 .cse0 .cse9 .cse2 .cse3 (not (<= |old(~local~0)| |old(~token~0)|)) .cse11 (not (<= |old(~token~0)| |old(~local~0)|)) .cse6 .cse7 .cse12) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse11 .cse6 .cse7))))) [2020-09-04 13:49:55,097 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (let ((.cse2 (= |old(~m_pc~0)| 1)) (.cse0 (not (<= 2 ~E_M~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse6 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (= ~M_E~0 0))) (and (or .cse0 (not (<= ~t1_pc~0 0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse1 .cse2 (not (<= |old(~local~0)| |old(~token~0)|)) .cse6 (not (<= |old(~token~0)| |old(~local~0)|)) .cse3 .cse4) (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse0 .cse5 .cse1 (not (<= |old(~token~0)| .cse7)) .cse6 .cse3 .cse4 (not (<= .cse7 |old(~token~0)|)))))) [2020-09-04 13:49:55,097 INFO L264 CegarLoopResult]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= |old(~token~0)| ~token~0))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (<= 2 ~E_M~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~M_E~0 0)) (.cse12 (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~local~0)| |old(~token~0)|)) .cse4 (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse6 (and .cse7 .cse8 .cse9 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse10 .cse11)) (or .cse0 (not (<= ~t1_pc~0 0)) .cse2 .cse3 .cse5 .cse6 .cse12) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse13)) .cse4 .cse5 .cse6 .cse12 (not (<= .cse13 |old(~token~0)|))))))) [2020-09-04 13:49:55,097 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (let ((.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (not (= ~m_pc~0 1))) (.cse8 (<= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (+ |old(~local~0)| 1))) (let ((.cse1 (not (= ~t1_pc~0 1))) (.cse3 (not (<= |old(~token~0)| .cse16))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse14 (and .cse6 .cse7 .cse15 .cse8 (not .cse11) .cse9 .cse10)) (.cse12 (not (<= .cse16 |old(~token~0)|))) (.cse0 (not (<= 2 ~E_M~0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse13 (= |old(~m_pc~0)| 1)) (.cse5 (not (<= 2 |old(~E_1~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse13 (not (<= |old(~local~0)| |old(~token~0)|)) .cse4 (not (<= |old(~token~0)| |old(~local~0)|)) .cse14 .cse5 .cse11) (or .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse11 .cse12) (or .cse0 (not (<= ~t1_pc~0 0)) .cse2 .cse13 .cse5 (and .cse6 .cse7 .cse15 .cse10) .cse11)))) [2020-09-04 13:49:55,097 INFO L268 CegarLoopResult]: For program point L51-1(line 51) no Hoare annotation was computed. [2020-09-04 13:49:55,098 INFO L264 CegarLoopResult]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= |old(~token~0)| ~token~0))) (let ((.cse3 (= |old(~m_pc~0)| 1)) (.cse0 (not (<= 2 ~E_M~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse6 (= ~M_E~0 0)) (.cse12 (and (= ~local~0 |old(~local~0)|) .cse7 .cse8 .cse9 .cse10 .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~local~0)| |old(~token~0)|)) .cse4 (not (<= |old(~token~0)| |old(~local~0)|)) .cse5 .cse6 (and .cse7 .cse8 .cse9 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse10 .cse11)) (or .cse0 (not (<= ~t1_pc~0 0)) .cse2 .cse3 .cse5 .cse6 .cse12) (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 (not (<= |old(~token~0)| .cse13)) .cse4 .cse5 .cse6 .cse12 (not (<= .cse13 |old(~token~0)|))))))) [2020-09-04 13:49:55,098 INFO L268 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2020-09-04 13:49:55,098 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2020-09-04 13:49:55,098 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse2 (not (<= ~t1_pc~0 0))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse5 (= ~m_pc~0 1)) (.cse0 (= |old(~M_E~0)| 0)) (.cse1 (not (<= 2 ~E_M~0))) (.cse13 (not (<= 2 ~m_st~0))) (.cse11 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse10 (not (<= 2 ~t1_st~0))) (.cse6 (= ~M_E~0 |old(~M_E~0)|)) (.cse9 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse9) (let ((.cse12 (+ ~local~0 1))) (or .cse0 .cse1 .cse11 (not (<= ~token~0 .cse12)) .cse3 (not (<= .cse12 ~token~0)) .cse10 .cse6 .cse7 .cse9)) (or .cse0 .cse1 .cse13 .cse11 .cse3 .cse4 .cse6 .cse8 .cse9) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse6 .cse9) (or .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse13 .cse3 .cse5 .cse6 .cse9) (or .cse0 .cse1 .cse13 .cse11 .cse3 .cse10 .cse6 .cse9))) [2020-09-04 13:49:55,098 INFO L268 CegarLoopResult]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2020-09-04 13:49:55,098 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:49:55,098 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~local~0 |old(~local~0)|) (= ~token~0 |old(~token~0)|) (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 |old(~t1_st~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~t1_i~0 |old(~t1_i~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~T1_E~0 |old(~T1_E~0)|) (= ~M_E~0 |old(~M_E~0)|) (= ~m_i~0 |old(~m_i~0)|) (= ~E_M~0 |old(~E_M~0)|)) [2020-09-04 13:49:55,098 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:49:55,099 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse5 (= ~local~0 |old(~local~0)|)) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse8 (= ~E_1~0 |old(~E_1~0)|)) (.cse9 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse22 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= |old(~token~0)| ~token~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|))) (let ((.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse17 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse18 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse0 (not (= |old(~t1_pc~0)| 1))) (.cse7 (= ~t1_pc~0 1)) (.cse16 (= |old(~m_pc~0)| 1)) (.cse24 (not (= |old(~m_st~0)| 0))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse21 (= ~m_st~0 0)) (.cse15 (and .cse5 .cse6 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12)) (.cse23 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse13 (= ~M_E~0 0)) (.cse14 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) (or .cse15 .cse1 .cse16 .cse3 .cse4 .cse13 .cse14) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse13 (and .cse6 .cse7 .cse8 .cse9 .cse19 .cse20 .cse10 .cse11 .cse12) .cse14) (or (and .cse8 .cse9 .cse19 .cse21 .cse22 .cse20 .cse10 .cse11 .cse12) .cse23 .cse1 .cse16 .cse24 .cse17 .cse18 .cse3 .cse4 .cse13) (or .cse0 (and .cse7 .cse8 .cse9 .cse19 .cse21 .cse20 .cse10 .cse11 .cse12) .cse1 .cse16 .cse24 .cse17 .cse2 .cse18 .cse3 .cse4 .cse13) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse24 (not (<= |old(~token~0)| .cse25)) .cse2 .cse3 .cse4 .cse13 (and .cse5 .cse7 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12) (not (<= .cse25 |old(~token~0)|)))) (or .cse23 .cse1 .cse16 .cse24 .cse2 .cse3 .cse4 .cse13 (and .cse5 .cse8 .cse9 .cse21 .cse22 .cse10 .cse11 .cse12)) (or .cse15 .cse23 .cse1 .cse3 .cse4 .cse13 .cse14)))) [2020-09-04 13:49:55,099 INFO L268 CegarLoopResult]: For program point L213(lines 213 220) no Hoare annotation was computed. [2020-09-04 13:49:55,099 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-09-04 13:49:55,099 INFO L268 CegarLoopResult]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2020-09-04 13:49:55,099 INFO L268 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-09-04 13:49:55,100 INFO L264 CegarLoopResult]: At program point L201(line 201) the Hoare annotation is: (let ((.cse16 (= ~M_E~0 0)) (.cse39 (+ ~local~0 1))) (let ((.cse36 (not (= ~m_pc~0 1))) (.cse34 (<= ~token~0 .cse39)) (.cse35 (<= .cse39 ~token~0)) (.cse27 (= ~m_st~0 0)) (.cse26 (<= ~token~0 ~local~0)) (.cse28 (<= ~local~0 ~token~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse38 (= |old(~t1_pc~0)| 1)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (not .cse16)) (.cse9 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (<= 2 ~E_M~0))) (let ((.cse31 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse33 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse24 (and .cse17 .cse18 .cse4 .cse38 .cse7 .cse8 .cse9 .cse10)) (.cse29 (and .cse18 .cse4 .cse38 .cse26 .cse7 .cse8 .cse9 .cse28 .cse10)) (.cse30 (and .cse17 .cse34 .cse35 .cse4 .cse38 .cse7 .cse27 .cse8 .cse9 .cse10)) (.cse25 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse0 (not (<= |old(~t1_pc~0)| 0))) (.cse22 (= |old(~m_pc~0)| 1)) (.cse23 (not (= |old(~m_st~0)| 0))) (.cse3 (= ~local~0 |old(~local~0)|)) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= ~t1_pc~0 1)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse21 (not .cse38)) (.cse1 (not .cse4)) (.cse32 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (and .cse18 .cse4 .cse36 .cse7 .cse8 .cse10)) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (not (<= 2 |old(~E_M~0)|))) (.cse20 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 (and .cse17 .cse18 .cse4 .cse19 .cse6 .cse7 .cse8 .cse10 .cse12) .cse20) (or .cse21 .cse1 .cse22 .cse23 .cse2 .cse24 .cse16 (and .cse19 .cse6 .cse25 .cse26 .cse27 .cse28 .cse11 .cse12 .cse13) .cse29 .cse30 .cse31 .cse32 .cse33 .cse14 .cse15) (or .cse1 .cse22 .cse2 .cse14 .cse15 .cse16 .cse20) (or .cse0 .cse1 .cse32 .cse2 .cse14 .cse15 .cse16 .cse9 .cse20) (or .cse1 .cse22 .cse23 .cse2 .cse16 (and .cse17 .cse34 .cse35 .cse4 .cse19 .cse7 .cse27 .cse8 .cse10) (and .cse18 .cse4 .cse19 .cse26 .cse7 .cse8 .cse28 .cse10) .cse0 .cse31 .cse33 (and .cse18 .cse4 .cse7 .cse8 .cse9 .cse10) (and .cse17 .cse19 .cse6 .cse36 .cse26 .cse27 .cse28 .cse12 .cse13) .cse14 .cse15 (and .cse6 .cse25 .cse26 .cse27 .cse9 .cse28 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse4 .cse19 .cse7 .cse8 .cse10)) (or .cse21 .cse1 .cse30 .cse31 .cse33 .cse2 .cse14 .cse15 .cse24 .cse16 .cse29 .cse20) (let ((.cse37 (+ |old(~local~0)| 1))) (or .cse21 .cse1 .cse23 .cse2 .cse24 .cse16 .cse29 .cse30 (not (<= |old(~token~0)| .cse37)) .cse32 .cse14 .cse15 (not (<= .cse37 |old(~token~0)|)))) (or (and .cse3 .cse6 .cse25 .cse27 .cse9 .cse11 .cse12 .cse13) .cse0 .cse1 .cse22 .cse23 .cse32 .cse2 .cse14 .cse15 .cse16 (and .cse17 .cse18 .cse4 .cse7 .cse8 .cse9 .cse10)) (or (and .cse3 .cse5 .cse19 .cse6 .cse11 .cse12 .cse13) .cse21 .cse1 .cse32 .cse2 .cse14 .cse15 .cse16 .cse20))))) [2020-09-04 13:49:55,100 INFO L264 CegarLoopResult]: At program point L230(line 230) the Hoare annotation is: (let ((.cse9 (= ~M_E~0 0))) (let ((.cse19 (<= ~token~0 ~local~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse15 (<= 2 ~m_st~0)) (.cse20 (not (= ~m_pc~0 1))) (.cse23 (<= 2 ~E_1~0)) (.cse24 (not .cse9)) (.cse25 (<= 2 ~E_M~0)) (.cse22 (<= 2 ~T1_E~0))) (let ((.cse12 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (= |old(~t1_pc~0)| 1))) (.cse5 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not .cse22)) (.cse11 (= |old(~m_pc~0)| 1)) (.cse3 (not (= |old(~m_st~0)| 0))) (.cse6 (and .cse15 .cse22 .cse20 .cse23 .cse24 .cse25)) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse0 (and .cse15 .cse22 (= ~t1_pc~0 1) .cse19 .cse23 .cse24 .cse21 .cse25)) (.cse10 (not (<= |old(~t1_pc~0)| 0))) (.cse13 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse14 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse17 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse7 (not (<= 2 |old(~E_1~0)|))) (.cse8 (not (<= 2 |old(~E_M~0)|)))) (and (let ((.cse4 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= |old(~token~0)| .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= .cse4 |old(~token~0)|)))) (or .cse10 .cse2 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12) (or .cse2 .cse11 .cse6 .cse7 .cse8 .cse9 .cse12) (or .cse0 .cse1 .cse2 .cse13 .cse6 .cse14 .cse7 .cse8 .cse9 .cse12) (or .cse10 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12) (or .cse10 .cse2 .cse6 .cse7 .cse8 (and .cse15 .cse16 .cse17 .cse18) .cse9 .cse12) (or .cse0 .cse1 .cse2 .cse11 .cse3 .cse13 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9) (or .cse2 .cse11 .cse3 .cse6 .cse9 (and .cse16 .cse19 .cse20 (= ~m_st~0 0) .cse17 .cse21 .cse18 (= |old(~token~0)| ~token~0)) .cse0 .cse10 .cse13 .cse14 (and .cse15 .cse22 .cse23 .cse24 .cse17 .cse25) .cse7 .cse8))))) [2020-09-04 13:49:55,101 INFO L264 CegarLoopResult]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse16 (= ~M_E~0 0)) (.cse39 (+ ~local~0 1))) (let ((.cse36 (not (= ~m_pc~0 1))) (.cse34 (<= ~token~0 .cse39)) (.cse35 (<= .cse39 ~token~0)) (.cse27 (= ~m_st~0 0)) (.cse26 (<= ~token~0 ~local~0)) (.cse28 (<= ~local~0 ~token~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse38 (= |old(~t1_pc~0)| 1)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (not .cse16)) (.cse9 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (<= 2 ~E_M~0))) (let ((.cse31 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse33 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse24 (and .cse17 .cse18 .cse4 .cse38 .cse7 .cse8 .cse9 .cse10)) (.cse29 (and .cse18 .cse4 .cse38 .cse26 .cse7 .cse8 .cse9 .cse28 .cse10)) (.cse30 (and .cse17 .cse34 .cse35 .cse4 .cse38 .cse7 .cse27 .cse8 .cse9 .cse10)) (.cse25 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse0 (not (<= |old(~t1_pc~0)| 0))) (.cse22 (= |old(~m_pc~0)| 1)) (.cse23 (not (= |old(~m_st~0)| 0))) (.cse3 (= ~local~0 |old(~local~0)|)) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= ~t1_pc~0 1)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse21 (not .cse38)) (.cse1 (not .cse4)) (.cse32 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (and .cse18 .cse4 .cse36 .cse7 .cse8 .cse10)) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (not (<= 2 |old(~E_M~0)|))) (.cse20 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 (and .cse17 .cse18 .cse4 .cse19 .cse6 .cse7 .cse8 .cse10 .cse12) .cse20) (or .cse21 .cse1 .cse22 .cse23 .cse2 .cse24 .cse16 (and .cse19 .cse6 .cse25 .cse26 .cse27 .cse28 .cse11 .cse12 .cse13) .cse29 .cse30 .cse31 .cse32 .cse33 .cse14 .cse15) (or .cse1 .cse22 .cse2 .cse14 .cse15 .cse16 .cse20) (or .cse0 .cse1 .cse32 .cse2 .cse14 .cse15 .cse16 .cse9 .cse20) (or .cse1 .cse22 .cse23 .cse2 .cse16 (and .cse17 .cse34 .cse35 .cse4 .cse19 .cse7 .cse27 .cse8 .cse10) (and .cse18 .cse4 .cse19 .cse26 .cse7 .cse8 .cse28 .cse10) .cse0 .cse31 .cse33 (and .cse18 .cse4 .cse7 .cse8 .cse9 .cse10) (and .cse17 .cse19 .cse6 .cse36 .cse26 .cse27 .cse28 .cse12 .cse13) .cse14 .cse15 (and .cse6 .cse25 .cse26 .cse27 .cse9 .cse28 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse4 .cse19 .cse7 .cse8 .cse10)) (or .cse21 .cse1 .cse30 .cse31 .cse33 .cse2 .cse14 .cse15 .cse24 .cse16 .cse29 .cse20) (let ((.cse37 (+ |old(~local~0)| 1))) (or .cse21 .cse1 .cse23 .cse2 .cse24 .cse16 .cse29 .cse30 (not (<= |old(~token~0)| .cse37)) .cse32 .cse14 .cse15 (not (<= .cse37 |old(~token~0)|)))) (or (and .cse3 .cse6 .cse25 .cse27 .cse9 .cse11 .cse12 .cse13) .cse0 .cse1 .cse22 .cse23 .cse32 .cse2 .cse14 .cse15 .cse16 (and .cse17 .cse18 .cse4 .cse7 .cse8 .cse9 .cse10)) (or (and .cse3 .cse5 .cse19 .cse6 .cse11 .cse12 .cse13) .cse21 .cse1 .cse32 .cse2 .cse14 .cse15 .cse16 .cse20))))) [2020-09-04 13:49:55,101 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2020-09-04 13:49:55,101 INFO L264 CegarLoopResult]: At program point L216(line 216) the Hoare annotation is: (let ((.cse6 (= ~M_E~0 0)) (.cse30 (+ ~local~0 1))) (let ((.cse9 (<= 2 ~t1_st~0)) (.cse26 (<= ~token~0 .cse30)) (.cse27 (<= .cse30 ~token~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse29 (= |old(~t1_pc~0)| 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (not .cse6)) (.cse17 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse18 (<= 2 ~E_M~0))) (let ((.cse7 (and .cse9 .cse26 .cse27 .cse10 .cse29 .cse14 .cse15 .cse17 .cse18)) (.cse0 (not .cse29)) (.cse2 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse3 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse12 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse20 (= |old(~token~0)| ~token~0)) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse25 (not (<= |old(~t1_pc~0)| 0))) (.cse1 (not .cse10)) (.cse21 (= |old(~m_pc~0)| 1)) (.cse22 (not (= |old(~m_st~0)| 0))) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (not (<= 2 |old(~E_M~0)|))) (.cse11 (= ~E_1~0 |old(~E_1~0)|)) (.cse13 (not (= ~m_pc~0 1))) (.cse19 (= ~E_M~0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse0 .cse1 .cse21 .cse22 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse24 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse22 (not (<= |old(~token~0)| .cse24)) .cse23 .cse4 .cse5 .cse6 .cse7 (not (<= .cse24 |old(~token~0)|)))) (or .cse0 .cse1 .cse23 .cse4 .cse5 .cse6 .cse8) (or .cse1 .cse21 .cse4 .cse5 .cse6 .cse8) (let ((.cse28 (= ~t1_pc~0 1))) (or .cse25 .cse1 .cse21 .cse22 .cse2 .cse3 (and .cse9 .cse26 .cse27 .cse10 .cse28 .cse14 .cse15 .cse18) .cse4 .cse5 (and .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) .cse6 (and .cse9 .cse10 .cse28 .cse11 .cse13 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20))) (or .cse25 .cse1 .cse4 .cse5 .cse6 .cse8) (or .cse25 .cse1 .cse21 .cse22 .cse23 .cse4 .cse5 .cse6 (and .cse9 .cse11 .cse13 .cse17 .cse19)))))) [2020-09-04 13:49:55,101 INFO L268 CegarLoopResult]: For program point L210(lines 200 238) no Hoare annotation was computed. [2020-09-04 13:49:55,102 INFO L264 CegarLoopResult]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse16 (= ~M_E~0 0)) (.cse39 (+ ~local~0 1))) (let ((.cse36 (not (= ~m_pc~0 1))) (.cse34 (<= ~token~0 .cse39)) (.cse35 (<= .cse39 ~token~0)) (.cse27 (= ~m_st~0 0)) (.cse26 (<= ~token~0 ~local~0)) (.cse28 (<= ~local~0 ~token~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse18 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse38 (= |old(~t1_pc~0)| 1)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (not .cse16)) (.cse9 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse10 (<= 2 ~E_M~0))) (let ((.cse31 (not (<= |old(~local~0)| |old(~token~0)|))) (.cse33 (not (<= |old(~token~0)| |old(~local~0)|))) (.cse24 (and .cse17 .cse18 .cse4 .cse38 .cse7 .cse8 .cse9 .cse10)) (.cse29 (and .cse18 .cse4 .cse38 .cse26 .cse7 .cse8 .cse9 .cse28 .cse10)) (.cse30 (and .cse17 .cse34 .cse35 .cse4 .cse38 .cse7 .cse27 .cse8 .cse9 .cse10)) (.cse25 (= ~m_pc~0 |old(~m_pc~0)|)) (.cse0 (not (<= |old(~t1_pc~0)| 0))) (.cse22 (= |old(~m_pc~0)| 1)) (.cse23 (not (= |old(~m_st~0)| 0))) (.cse3 (= ~local~0 |old(~local~0)|)) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse19 (= ~t1_pc~0 1)) (.cse6 (= ~E_1~0 |old(~E_1~0)|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (= ~E_M~0 |old(~E_M~0)|)) (.cse13 (= |old(~token~0)| ~token~0)) (.cse21 (not .cse38)) (.cse1 (not .cse4)) (.cse32 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (and .cse18 .cse4 .cse36 .cse7 .cse8 .cse10)) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (not (<= 2 |old(~E_M~0)|))) (.cse20 (not (<= 2 |old(~m_st~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 (and .cse17 .cse18 .cse4 .cse19 .cse6 .cse7 .cse8 .cse10 .cse12) .cse20) (or .cse21 .cse1 .cse22 .cse23 .cse2 .cse24 .cse16 (and .cse19 .cse6 .cse25 .cse26 .cse27 .cse28 .cse11 .cse12 .cse13) .cse29 .cse30 .cse31 .cse32 .cse33 .cse14 .cse15) (or .cse1 .cse22 .cse2 .cse14 .cse15 .cse16 .cse20) (or .cse0 .cse1 .cse32 .cse2 .cse14 .cse15 .cse16 .cse9 .cse20) (or .cse1 .cse22 .cse23 .cse2 .cse16 (and .cse17 .cse34 .cse35 .cse4 .cse19 .cse7 .cse27 .cse8 .cse10) (and .cse18 .cse4 .cse19 .cse26 .cse7 .cse8 .cse28 .cse10) .cse0 .cse31 .cse33 (and .cse18 .cse4 .cse7 .cse8 .cse9 .cse10) (and .cse17 .cse19 .cse6 .cse36 .cse26 .cse27 .cse28 .cse12 .cse13) .cse14 .cse15 (and .cse6 .cse25 .cse26 .cse27 .cse9 .cse28 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse4 .cse19 .cse7 .cse8 .cse10)) (or .cse21 .cse1 .cse30 .cse31 .cse33 .cse2 .cse14 .cse15 .cse24 .cse16 .cse29 .cse20) (let ((.cse37 (+ |old(~local~0)| 1))) (or .cse21 .cse1 .cse23 .cse2 .cse24 .cse16 .cse29 .cse30 (not (<= |old(~token~0)| .cse37)) .cse32 .cse14 .cse15 (not (<= .cse37 |old(~token~0)|)))) (or (and .cse3 .cse6 .cse25 .cse27 .cse9 .cse11 .cse12 .cse13) .cse0 .cse1 .cse22 .cse23 .cse32 .cse2 .cse14 .cse15 .cse16 (and .cse17 .cse18 .cse4 .cse7 .cse8 .cse9 .cse10)) (or (and .cse3 .cse5 .cse19 .cse6 .cse11 .cse12 .cse13) .cse21 .cse1 .cse32 .cse2 .cse14 .cse15 .cse16 .cse20))))) [2020-09-04 13:49:55,102 INFO L268 CegarLoopResult]: For program point L227(lines 227 234) no Hoare annotation was computed. [2020-09-04 13:49:55,102 INFO L271 CegarLoopResult]: At program point L399(lines 388 401) the Hoare annotation is: true [2020-09-04 13:49:55,102 INFO L268 CegarLoopResult]: For program point L392(lines 392 397) no Hoare annotation was computed. [2020-09-04 13:49:55,103 INFO L271 CegarLoopResult]: At program point L390(line 390) the Hoare annotation is: true [2020-09-04 13:49:55,103 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2020-09-04 13:49:55,103 INFO L268 CegarLoopResult]: For program point L390-1(line 390) no Hoare annotation was computed. [2020-09-04 13:49:55,103 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2020-09-04 13:49:55,103 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2020-09-04 13:49:55,103 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2020-09-04 13:49:55,103 INFO L271 CegarLoopResult]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2020-09-04 13:49:55,104 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse7 (not (<= ~t1_pc~0 0))) (.cse12 (not (<= ~token~0 ~local~0))) (.cse6 (= ~m_pc~0 1)) (.cse11 (not (= ~m_st~0 0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse0 (= |old(~M_E~0)| 0)) (.cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse2 (not (<= 2 ~m_st~0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse10 (not (<= 2 ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse8 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse3 .cse4 .cse5 .cse10 .cse11)) (or .cse0 .cse1 .cse2 .cse8 .cse12 .cse3 .cse4 .cse5 .cse13) (or .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11) (or .cse0 .cse1 .cse7 .cse12 .cse3 .cse4 .cse5 .cse6 .cse11 .cse13) (or .cse0 .cse1 .cse8 .cse12 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11 .cse13) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse10))) [2020-09-04 13:49:55,104 INFO L268 CegarLoopResult]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2020-09-04 13:49:55,104 INFO L268 CegarLoopResult]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2020-09-04 13:49:55,104 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2020-09-04 13:49:55,104 INFO L268 CegarLoopResult]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2020-09-04 13:49:55,104 INFO L268 CegarLoopResult]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2020-09-04 13:49:55,105 INFO L268 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2020-09-04 13:49:55,105 INFO L264 CegarLoopResult]: At program point L413(line 413) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse5 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 (<= ~local~0 ~token~0) .cse6 (= |old(~token~0)| ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= |old(~token~0)| |old(~local~0)|)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-09-04 13:49:55,105 INFO L264 CegarLoopResult]: At program point L411(line 411) the Hoare annotation is: (or (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (<= ~local~0 ~token~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|))) [2020-09-04 13:49:55,105 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2020-09-04 13:49:55,105 INFO L264 CegarLoopResult]: At program point L411-1(line 411) the Hoare annotation is: (or (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (<= ~local~0 ~token~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|))) [2020-09-04 13:49:55,106 INFO L264 CegarLoopResult]: At program point L440(line 440) the Hoare annotation is: (let ((.cse13 (= |old(~token~0)| ~token~0)) (.cse0 (<= 2 ~t1_st~0)) (.cse11 (not (= ~m_pc~0 1))) (.cse7 (= ~m_st~0 0)) (.cse14 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse9 (<= 2 ~m_st~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~t1_pc~0 1)) (.cse4 (= |old(~T1_E~0)| ~T1_E~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse5 (<= 2 ~E_1~0)) (.cse6 (not (= ~M_E~0 0))) (.cse12 (<= ~local~0 ~token~0)) (.cse8 (<= 2 ~E_M~0))) (or (let ((.cse1 (+ ~local~0 1))) (and .cse0 (<= ~token~0 .cse1) (<= .cse1 ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse11 .cse5 .cse6 .cse7 .cse12 .cse8 .cse13) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (and .cse9 .cse2 .cse4 .cse5 .cse6 .cse14 .cse8) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse2 .cse4 .cse11 .cse10 .cse5 .cse6 .cse7 .cse14 .cse12 .cse8 .cse13) (and .cse9 .cse2 .cse4 .cse11 .cse5 .cse6 .cse8) (and .cse0 .cse2 .cse4 .cse11 .cse5 .cse6 .cse7 .cse14 .cse8) (and .cse9 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse12 .cse8))) [2020-09-04 13:49:55,106 INFO L264 CegarLoopResult]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,106 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,107 INFO L264 CegarLoopResult]: At program point L430(line 430) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,107 INFO L264 CegarLoopResult]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,107 INFO L264 CegarLoopResult]: At program point L426(line 426) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,108 INFO L268 CegarLoopResult]: For program point L426-1(line 426) no Hoare annotation was computed. [2020-09-04 13:49:55,108 INFO L264 CegarLoopResult]: At program point L422(line 422) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,108 INFO L268 CegarLoopResult]: For program point L422-1(line 422) no Hoare annotation was computed. [2020-09-04 13:49:55,108 INFO L264 CegarLoopResult]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,109 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (and (= ~E_1~0 |old(~E_1~0)|) (= ~m_pc~0 |old(~m_pc~0)|) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 |old(~M_E~0)|) (= ~m_st~0 0) (= |old(~t1_pc~0)| ~t1_pc~0) (<= ~local~0 ~token~0) (= |old(~t1_st~0)| ~t1_st~0) (= |old(~token~0)| ~token~0) (= ~E_M~0 |old(~E_M~0)|))) [2020-09-04 13:49:55,109 INFO L264 CegarLoopResult]: At program point L414(line 414) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse5 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 (<= ~local~0 ~token~0) .cse6 (= |old(~token~0)| ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= |old(~token~0)| |old(~local~0)|)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-09-04 13:49:55,109 INFO L264 CegarLoopResult]: At program point L412(line 412) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse5 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse0 (= ~E_1~0 |old(~E_1~0)|)) (.cse1 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~M_E~0 |old(~M_E~0)|)) (.cse6 (= ~E_M~0 |old(~E_M~0)|))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 (<= ~local~0 ~token~0) .cse6 (= |old(~token~0)| ~token~0)) (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (and (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= |old(~token~0)| |old(~local~0)|)) (and (<= 2 ~m_st~0) .cse0 .cse1 .cse2 .cse3 .cse6) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)))) [2020-09-04 13:49:55,110 INFO L264 CegarLoopResult]: At program point L441(line 441) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,110 INFO L268 CegarLoopResult]: For program point L437(lines 437 446) no Hoare annotation was computed. [2020-09-04 13:49:55,110 INFO L264 CegarLoopResult]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,110 INFO L268 CegarLoopResult]: For program point L435(line 435) no Hoare annotation was computed. [2020-09-04 13:49:55,110 INFO L264 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (let ((.cse10 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (= |old(~token~0)| ~token~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse6 (= |old(~t1_pc~0)| ~t1_pc~0)) (.cse11 (<= 2 ~m_st~0)) (.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (<= 2 ~E_1~0)) (.cse5 (not (= ~M_E~0 0))) (.cse8 (<= 2 ~E_M~0))) (or (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (<= 2 |old(~M_E~0)|)) (and .cse10 .cse11 .cse12 .cse0 .cse3 .cse5 .cse8) (not (<= 2 |old(~T1_E~0)|)) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (let ((.cse13 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse13) (<= .cse13 ~token~0) .cse12 .cse0 .cse3 .cse4 .cse5 .cse8)) (and .cse10 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (not (<= |old(~t1_pc~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~E_1~0)|)) (and .cse11 .cse12 .cse0 .cse1 .cse3 .cse5 .cse7 .cse8) (and .cse11 .cse0 .cse3 .cse5 .cse6 .cse8) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse8))) [2020-09-04 13:49:55,111 INFO L264 CegarLoopResult]: At program point L456(lines 403 461) the Hoare annotation is: (or (not (<= |old(~t1_pc~0)| 0)) (= |old(~m_pc~0)| 1) (not (= |old(~m_st~0)| 0)) (not (<= |old(~local~0)| |old(~token~0)|)) (not (<= |old(~token~0)| |old(~local~0)|)) (not (<= 2 |old(~E_1~0)|)) (not (<= 2 |old(~E_M~0)|)) (not (<= 2 |old(~M_E~0)|)) (not (<= 2 |old(~T1_E~0)|)) (not (= ~M_E~0 0))) [2020-09-04 13:49:55,111 INFO L268 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2020-09-04 13:49:55,111 INFO L268 CegarLoopResult]: For program point L450(lines 450 454) no Hoare annotation was computed. [2020-09-04 13:49:55,111 INFO L264 CegarLoopResult]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse15 (+ ~local~0 1))) (let ((.cse5 (not (<= ~token~0 ~local~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse0 (= ~E_1~0 0)) (.cse11 (not (<= ~t1_pc~0 0))) (.cse12 (= ~m_pc~0 1)) (.cse1 (not (<= 2 ~E_M~0))) (.cse7 (not (<= 2 ~t1_st~0))) (.cse9 (not (<= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse13 (not (<= ~token~0 .cse15))) (.cse3 (and (<= 0 is_master_triggered_~__retres1~0) (<= is_master_triggered_~__retres1~0 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse14 (not (<= .cse15 ~token~0))) (.cse6 (= ~M_E~0 0)) (.cse10 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10) (or .cse1 .cse9 .cse3 .cse11 .cse4 .cse6 .cse10) (or .cse0 .cse1 .cse3 .cse11 .cse4 .cse6 .cse12) (or .cse9 .cse3 .cse4 .cse6 .cse12 .cse10) (or .cse1 .cse9 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10) (or .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse6 .cse7 (not (= ~m_st~0 0)) .cse10) (or .cse9 .cse2 .cse13 .cse3 .cse4 .cse14 (= ~E_M~0 1) .cse6 .cse10)))) [2020-09-04 13:49:55,111 INFO L268 CegarLoopResult]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2020-09-04 13:49:55,111 INFO L268 CegarLoopResult]: For program point L115(lines 115 120) no Hoare annotation was computed. [2020-09-04 13:49:55,112 INFO L268 CegarLoopResult]: For program point L114(lines 114 123) no Hoare annotation was computed. [2020-09-04 13:49:55,112 INFO L268 CegarLoopResult]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2020-09-04 13:49:55,112 INFO L268 CegarLoopResult]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2020-09-04 13:49:55,112 INFO L271 CegarLoopResult]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2020-09-04 13:49:55,112 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:49:55,112 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~M_E~0) (<= 2 ~T1_E~0) (<= ~t1_pc~0 0) (<= ~token~0 ~local~0) (not (= ~m_pc~0 1)) (<= 2 ~E_1~0) (= ~m_st~0 0) (<= ~local~0 ~token~0) (<= 2 ~E_M~0)) [2020-09-04 13:49:55,112 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:49:55,112 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:49:55,113 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2020-09-04 13:49:55,113 INFO L268 CegarLoopResult]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2020-09-04 13:49:55,113 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse7 (not (<= ~t1_pc~0 0))) (.cse12 (not (<= ~token~0 ~local~0))) (.cse6 (= ~m_pc~0 1)) (.cse11 (not (= ~m_st~0 0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse0 (= |old(~M_E~0)| 0)) (.cse1 (and (= ~E_1~0 |old(~E_1~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))) (.cse2 (not (<= 2 ~m_st~0))) (.cse8 (not (= ~t1_pc~0 1))) (.cse3 (not (<= 2 |old(~E_1~0)|))) (.cse4 (not (<= 2 |old(~E_M~0)|))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse10 (not (<= 2 ~t1_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse8 (not (<= ~token~0 .cse9)) (not (<= .cse9 ~token~0)) .cse3 .cse4 .cse5 .cse10 .cse11)) (or .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse8 .cse12 .cse3 .cse4 .cse5 .cse13) (or .cse0 .cse1 .cse7 .cse12 .cse3 .cse4 .cse5 .cse6 .cse11 .cse13) (or .cse0 .cse1 .cse8 .cse12 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11 .cse13) (or .cse0 .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse10))) [2020-09-04 13:49:55,113 INFO L268 CegarLoopResult]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2020-09-04 13:49:55,113 INFO L268 CegarLoopResult]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2020-09-04 13:49:55,113 INFO L268 CegarLoopResult]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2020-09-04 13:49:55,114 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2020-09-04 13:49:55,114 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2020-09-04 13:49:55,114 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: (or (not (<= 2 ~E_M~0)) (not (<= ~t1_pc~0 0)) (not (<= 2 ~T1_E~0)) (not (<= ~token~0 ~local~0)) (= ~m_pc~0 1) (and (= ~t1_i~0 |old(~t1_i~0)|) (= |old(~m_i~0)| ~m_i~0)) (not (<= 2 ~M_E~0)) (not (= ~m_st~0 0)) (not (<= ~local~0 ~token~0)) (not (<= 2 ~E_1~0))) [2020-09-04 13:49:55,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:49:55 BoogieIcfgContainer [2020-09-04 13:49:55,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:49:55,222 INFO L168 Benchmark]: Toolchain (without parser) took 121793.98 ms. Allocated memory was 147.3 MB in the beginning and 505.4 MB in the end (delta: 358.1 MB). Free memory was 103.8 MB in the beginning and 439.6 MB in the end (delta: -335.7 MB). Peak memory consumption was 543.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:55,223 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 13:49:55,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.97 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 182.4 MB in the end (delta: -78.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:55,224 INFO L168 Benchmark]: Boogie Preprocessor took 69.85 ms. Allocated memory is still 204.5 MB. Free memory was 182.4 MB in the beginning and 180.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:55,224 INFO L168 Benchmark]: RCFGBuilder took 626.97 ms. Allocated memory is still 204.5 MB. Free memory was 180.4 MB in the beginning and 149.1 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:55,225 INFO L168 Benchmark]: TraceAbstraction took 120482.51 ms. Allocated memory was 204.5 MB in the beginning and 505.4 MB in the end (delta: 300.9 MB). Free memory was 148.4 MB in the beginning and 439.6 MB in the end (delta: -291.2 MB). Peak memory consumption was 530.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:49:55,227 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 606.97 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 182.4 MB in the end (delta: -78.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.85 ms. Allocated memory is still 204.5 MB. Free memory was 182.4 MB in the beginning and 180.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 626.97 ms. Allocated memory is still 204.5 MB. Free memory was 180.4 MB in the beginning and 149.1 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120482.51 ms. Allocated memory was 204.5 MB in the beginning and 505.4 MB in the end (delta: 300.9 MB). Free memory was 148.4 MB in the beginning and 439.6 MB in the end (delta: -291.2 MB). Peak memory consumption was 530.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(t1_pc) <= 0) || !(2 <= T1_E)) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || ((((((((((local == \old(local) && 2 <= T1_E) && m_st == \old(m_st)) && E_1 == \old(E_1)) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || ((((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && t1_pc == 1) && E_1 == \old(E_1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M) && E_M == \old(E_M))) || !(2 <= \old(m_st))) && ((((((((((((((!(\old(t1_pc) == 1) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || (((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || M_E == 0) || ((((((((t1_pc == 1 && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || ((((((((2 <= m_st && 2 <= T1_E) && \old(t1_pc) == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && local <= token) && 2 <= E_M)) || (((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M)))) && ((((((!(2 <= T1_E) || \old(m_pc) == 1) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_pc) <= 0) || !(2 <= T1_E)) || !(2 <= \old(t1_st))) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || \old(t1_pc) == t1_pc) || !(2 <= \old(m_st)))) && (((((((((((((((!(2 <= T1_E) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || M_E == 0) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && 2 <= T1_E) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && 2 <= E_M)) || (((((((2 <= m_st && 2 <= T1_E) && t1_pc == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && local <= token) && 2 <= E_M)) || !(\old(t1_pc) <= 0)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || (((((2 <= m_st && 2 <= T1_E) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || ((((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && !(m_pc == 1)) && token <= local) && m_st == 0) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || ((((((((E_1 == \old(E_1) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && \old(t1_pc) == t1_pc) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || ((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && t1_pc == 1) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M))) && (((((((((((!(\old(t1_pc) == 1) || !(2 <= T1_E)) || (((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || M_E == 0) || ((((((((2 <= m_st && 2 <= T1_E) && \old(t1_pc) == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && local <= token) && 2 <= E_M)) || !(2 <= \old(m_st)))) && ((((((((((((!(\old(t1_pc) == 1) || !(2 <= T1_E)) || !(\old(m_st) == 0)) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || (((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || M_E == 0) || ((((((((2 <= m_st && 2 <= T1_E) && \old(t1_pc) == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && local <= token) && 2 <= E_M)) || (((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || !(\old(local) + 1 <= \old(token)))) && (((((((((((((((((local == \old(local) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && m_st == 0) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || !(2 <= \old(t1_st))) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || ((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M))) && ((((((((((((((local == \old(local) && m_st == \old(m_st)) && t1_pc == 1) && E_1 == \old(E_1)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || !(\old(t1_pc) == 1)) || !(2 <= T1_E)) || !(2 <= \old(t1_st))) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || !(2 <= \old(m_st))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((E_1 == 0 || !(2 <= E_M)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= T1_E)) || !(token <= local)) || M_E == 0) || !(2 <= t1_st)) || !(local <= token)) && ((((((((!(2 <= E_M) || !(2 <= m_st)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= T1_E)) || !(token <= local)) || M_E == 0) || !(local <= token)) || !(2 <= E_1))) && ((((((!(2 <= E_M) || !(2 <= m_st)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc <= 0)) || !(2 <= T1_E)) || M_E == 0) || !(2 <= E_1))) && ((((((E_1 == 0 || !(2 <= E_M)) || (0 <= __retres1 && __retres1 <= 0)) || !(t1_pc <= 0)) || !(2 <= T1_E)) || M_E == 0) || m_pc == 1)) && (((((!(2 <= m_st) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= T1_E)) || M_E == 0) || m_pc == 1) || !(2 <= E_1))) && (((((((!(2 <= E_M) || !(2 <= m_st)) || !(t1_pc == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= T1_E)) || M_E == 0) || !(2 <= t1_st)) || !(2 <= E_1))) && (((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= T1_E)) || !(local + 1 <= token)) || M_E == 0) || !(2 <= t1_st)) || !(m_st == 0)) || !(2 <= E_1))) && ((((((((!(2 <= m_st) || !(t1_pc == 1)) || !(token <= local + 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= T1_E)) || !(local + 1 <= token)) || E_M == 1) || M_E == 0) || !(2 <= E_1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((!(2 <= E_M) || !(t1_pc <= 0)) || !(2 <= T1_E)) || \old(m_pc) == 1) || (2 <= m_st && 2 <= E_1)) || !(2 <= \old(E_1))) || M_E == 0) && ((((((((((((((((2 <= m_st && 2 <= T1_E) && t1_pc == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && local <= token) && 2 <= E_M) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || M_E == 0) || ((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && t1_pc == 1) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(\old(local) + 1 <= \old(token)))) && (((((((((((((((((2 <= m_st && 2 <= T1_E) && t1_pc == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && local <= token) && 2 <= E_M) || !(2 <= E_M)) || !(t1_pc == 1)) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || M_E == 0) || ((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && t1_pc == 1) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M))) && (((((((2 <= t1_st || !(2 <= E_M)) || !(t1_pc <= 0)) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || M_E == 0) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((!(\old(t1_pc) <= 0) || !(2 <= T1_E)) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(E_M))) || M_E == 0) || ((((((2 <= T1_E && m_st == \old(m_st)) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M) && \old(t1_st) == t1_st)) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((((((!(\old(token) <= local) || !(\old(t1_pc) == 1)) || !(2 <= T1_E)) || !(2 <= \old(E_M))) || ((((((2 <= T1_E && m_st == \old(m_st)) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M) && \old(t1_st) == t1_st)) || !(local <= \old(token))) || M_E == 0) || !(m_pc == 1)) || !(2 <= \old(m_st))) || (((((((2 <= T1_E && \old(token) + 1 <= token) && token <= \old(token) + 1) && 2 <= E_1) && !(M_E == 0)) && m_st == 0) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || !(2 <= E_1))) && ((((((!(2 <= T1_E) || !(2 <= \old(E_M))) || M_E == 0) || m_pc == 1) || ((((((2 <= T1_E && m_st == \old(m_st)) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M) && \old(t1_st) == t1_st)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((((!(\old(token) <= local) || ((((m_st == 0 && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(\old(m_st) == 0)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || M_E == 0) || m_pc == 1) || !(2 <= E_1)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(t1_pc) <= 0) || !(2 <= T1_E)) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || ((((((((((local == \old(local) && 2 <= T1_E) && m_st == \old(m_st)) && E_1 == \old(E_1)) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || ((((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && t1_pc == 1) && E_1 == \old(E_1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M) && E_M == \old(E_M))) || !(2 <= \old(m_st))) && ((((((((((((((!(\old(t1_pc) == 1) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || (((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || M_E == 0) || ((((((((t1_pc == 1 && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || ((((((((2 <= m_st && 2 <= T1_E) && \old(t1_pc) == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && local <= token) && 2 <= E_M)) || (((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M)))) && ((((((!(2 <= T1_E) || \old(m_pc) == 1) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || !(2 <= \old(m_st)))) && ((((((((!(\old(t1_pc) <= 0) || !(2 <= T1_E)) || !(2 <= \old(t1_st))) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || \old(t1_pc) == t1_pc) || !(2 <= \old(m_st)))) && (((((((((((((((!(2 <= T1_E) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || M_E == 0) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && 2 <= T1_E) && t1_pc == 1) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && 2 <= E_M)) || (((((((2 <= m_st && 2 <= T1_E) && t1_pc == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && local <= token) && 2 <= E_M)) || !(\old(t1_pc) <= 0)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || (((((2 <= m_st && 2 <= T1_E) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || ((((((((2 <= t1_st && t1_pc == 1) && E_1 == \old(E_1)) && !(m_pc == 1)) && token <= local) && m_st == 0) && local <= token) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || ((((((((E_1 == \old(E_1) && m_pc == \old(m_pc)) && token <= local) && m_st == 0) && \old(t1_pc) == t1_pc) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token)) || ((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && t1_pc == 1) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M))) && (((((((((((!(\old(t1_pc) == 1) || !(2 <= T1_E)) || (((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || (((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || M_E == 0) || ((((((((2 <= m_st && 2 <= T1_E) && \old(t1_pc) == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && local <= token) && 2 <= E_M)) || !(2 <= \old(m_st)))) && ((((((((((((!(\old(t1_pc) == 1) || !(2 <= T1_E)) || !(\old(m_st) == 0)) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || (((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || M_E == 0) || ((((((((2 <= m_st && 2 <= T1_E) && \old(t1_pc) == 1) && token <= local) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && local <= token) && 2 <= E_M)) || (((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && 2 <= T1_E) && \old(t1_pc) == 1) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || !(\old(local) + 1 <= \old(token)))) && (((((((((((((((((local == \old(local) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && m_st == 0) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || !(2 <= \old(t1_st))) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || ((((((2 <= t1_st && 2 <= m_st) && 2 <= T1_E) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M))) && ((((((((((((((local == \old(local) && m_st == \old(m_st)) && t1_pc == 1) && E_1 == \old(E_1)) && \old(t1_st) == t1_st) && E_M == \old(E_M)) && \old(token) == token) || !(\old(t1_pc) == 1)) || !(2 <= T1_E)) || !(2 <= \old(t1_st))) || (((((2 <= m_st && 2 <= T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || M_E == 0) || !(2 <= \old(m_st))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((!(\old(token) <= local) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(\old(m_st) == 0)) || ((((2 <= t1_st && t1_pc == 1) && m_st == 0) && E_M == \old(E_M)) && \old(token) == token)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || M_E == 0) || m_pc == 1) || !(2 <= E_1)) && ((((((((((!(\old(token) <= local) || !(\old(t1_pc) == 1)) || !(2 <= T1_E)) || (((((2 <= t1_st && t1_pc == 1) && \old(token) + 1 <= token) && token <= \old(token) + 1) && m_st == 0) && 2 <= E_M)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || M_E == 0) || (((2 <= t1_st && 2 <= m_st) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || (((2 <= m_st && !(m_pc == 1)) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((!(2 <= T1_E) || !(2 <= \old(E_M))) || M_E == 0) || m_pc == 1) || (((2 <= m_st && !(m_pc == 1)) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(m_st))) || !(2 <= E_1))) && (((((((!(\old(t1_pc) <= 0) || !(2 <= T1_E)) || !(2 <= \old(E_M))) || M_E == 0) || (((2 <= m_st && !(m_pc == 1)) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(m_st))) || !(2 <= E_1)) || (((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && E_M == \old(E_M))) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((!(2 <= T1_E) || ((((m_st == \old(m_st) && \old(t1_pc) == t1_pc) && \old(t1_st) == t1_st) && \old(token) == token) && E_M == \old(E_M))) || !(2 <= \old(E_M))) || M_E == 0) || m_pc == 1) || !(2 <= \old(m_st))) || !(2 <= E_1)) && ((((((((!(\old(token) <= local) || (((((m_st == \old(m_st) && t1_pc == 1) && token <= local) && local <= token) && \old(t1_st) == t1_st) && E_M == \old(E_M))) || !(\old(t1_pc) == 1)) || !(2 <= T1_E)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || M_E == 0) || !(2 <= \old(m_st))) || !(2 <= E_1))) && ((((((((!(\old(token) <= local) || !(\old(t1_pc) <= 0)) || !(2 <= T1_E)) || !(\old(m_st) == 0)) || !(2 <= \old(E_M))) || !(local <= \old(token))) || M_E == 0) || m_pc == 1) || !(2 <= E_1))) && (((((!(\old(t1_pc) <= 0) || !(2 <= T1_E)) || !(2 <= \old(E_M))) || M_E == 0) || !(2 <= \old(m_st))) || !(2 <= E_1)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((\old(m_pc) == 1 || !(\old(m_st) == 0)) || (((((((((\old(T1_E) == T1_E && token <= local) && !(m_pc == 1)) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && local <= token) && 2 <= E_M) && \old(token) == token)) || !(2 <= \old(M_E))) || ((((((2 <= t1_st && 2 <= m_st) && t1_pc == 1) && \old(T1_E) == T1_E) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M)) || !(2 <= \old(T1_E))) || (((((((2 <= t1_st && \old(T1_E) == T1_E) && !(m_pc == 1)) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || ((((((((2 <= t1_st && token <= local + 1) && local + 1 <= token) && t1_pc == 1) && \old(T1_E) == T1_E) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && 2 <= E_M)) || ((((((((((2 <= t1_st && t1_pc == 1) && \old(T1_E) == T1_E) && token <= local) && !(m_pc == 1)) && 2 <= E_1) && m_st == 0) && !(M_E == 0)) && local <= token) && 2 <= E_M) && \old(token) == token)) || !(\old(t1_pc) <= 0)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_M))) || !(2 <= \old(E_1))) || (((((((2 <= m_st && t1_pc == 1) && \old(T1_E) == T1_E) && token <= local) && 2 <= E_1) && !(M_E == 0)) && local <= token) && 2 <= E_M)) || (((((2 <= m_st && \old(T1_E) == T1_E) && 2 <= E_1) && !(M_E == 0)) && \old(t1_pc) == t1_pc) && 2 <= E_M)) || (((((2 <= m_st && \old(T1_E) == T1_E) && !(m_pc == 1)) && 2 <= E_1) && !(M_E == 0)) && 2 <= E_M) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || M_E == 0) || !(\old(local) + 1 <= \old(token))) && (((((!(2 <= E_M) || !(t1_pc <= 0)) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(2 <= \old(E_1))) || M_E == 0)) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || M_E == 0)) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || M_E == 0) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(\old(local) + 1 <= \old(token))) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= E_M) || !(2 <= m_st)) || !(t1_pc <= 0)) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0)) || M_E == 0) || !(2 <= E_1)) && ((((((E_1 == 0 || !(2 <= E_M)) || !(t1_pc <= 0)) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0)) || M_E == 0) || m_pc == 1)) && (((((!(2 <= m_st) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0)) || m_pc == 1) || M_E == 0) || !(2 <= E_1))) && ((((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(token <= local)) || M_E == 0) || m_pc == 1) || !(2 <= t1_st)) || !(m_st == 0)) || !(local <= token)) || !(2 <= E_1))) && (((((((!(t1_pc == 1) || !(token <= local + 1)) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0)) || !(local + 1 <= token)) || M_E == 0) || !(m_st == 0)) || !(2 <= E_1))) && (((((!(2 <= m_st) || !(t1_pc == 1)) || !(2 <= T1_E)) || (0 <= __retres1 && __retres1 <= 0)) || M_E == 0) || !(2 <= E_1)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((!(\old(t1_pc) <= 0) || \old(m_pc) == 1) || !(\old(m_st) == 0)) || !(\old(local) <= \old(token))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || !(2 <= \old(E_M))) || !(2 <= \old(M_E))) || !(2 <= \old(T1_E))) || !(M_E == 0) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(\old(local) <= \old(token))) || !(2 <= \old(t1_st))) || !(\old(token) <= \old(local))) || !(2 <= \old(E_1))) || M_E == 0) || ((((((m_st == \old(m_st) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && token <= local) && local <= token) && \old(t1_st) == t1_st) && \old(token) == token)) && ((((((!(2 <= E_M) || !(t1_pc <= 0)) || !(2 <= T1_E)) || \old(m_pc) == 1) || !(2 <= \old(E_1))) || M_E == 0) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token))) && ((((((((!(2 <= E_M) || !(t1_pc == 1)) || !(2 <= T1_E)) || !(\old(token) <= \old(local) + 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(E_1))) || M_E == 0) || (((((local == \old(local) && m_st == \old(m_st)) && E_1 == \old(E_1)) && m_pc == \old(m_pc)) && \old(t1_st) == t1_st) && \old(token) == token)) || !(\old(local) + 1 <= \old(token))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.8s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 94.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2270 SDtfs, 5501 SDslu, 1065 SDs, 0 SdLazy, 8914 SolverSat, 2968 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1570 GetRequests, 1372 SyntacticMatches, 5 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1598occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1144 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 3649 PreInvPairs, 4853 NumberOfFragments, 13390 HoareAnnotationTreeSize, 3649 FomulaSimplifications, 24968783 FormulaSimplificationTreeSizeReduction, 59.2s HoareSimplificationTime, 62 FomulaSimplificationsInter, 852782 FormulaSimplificationTreeSizeReductionInter, 34.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2442 ConstructedInterpolants, 0 QuantifiedInterpolants, 747593 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3947 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 873/1000 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...