./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5e27a879cb97b2b6600a7b4379c4e090f4fa709a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:08:46,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:08:46,905 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:08:46,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:08:46,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:08:46,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:08:46,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:08:46,932 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:08:46,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:08:46,935 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:08:46,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:08:46,937 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:08:46,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:08:46,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:08:46,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:08:46,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:08:46,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:08:46,946 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:08:46,948 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:08:46,950 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:08:46,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:08:46,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:08:46,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:08:46,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:08:46,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:08:46,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:08:46,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:08:46,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:08:46,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:08:46,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:08:46,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:08:46,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:08:46,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:08:46,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:08:46,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:08:46,968 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:08:46,968 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:08:46,988 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:08:46,988 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:08:46,990 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:08:46,990 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:08:46,990 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:08:46,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:08:46,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:08:46,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:08:46,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:08:46,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:08:46,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:08:46,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:08:46,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:08:46,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:08:46,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:08:46,993 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:08:46,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:08:46,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:08:46,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:08:46,994 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:08:46,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:08:46,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:08:46,997 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:08:46,997 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:08:46,997 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:08:46,998 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:08:46,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:08:46,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:08:46,999 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5e27a879cb97b2b6600a7b4379c4e090f4fa709a [2018-12-31 10:08:47,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:08:47,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:08:47,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:08:47,082 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:08:47,083 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:08:47,084 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c [2018-12-31 10:08:47,181 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5084982f9/9718258e57d1443190b3452585d79a36/FLAGb9bd41057 [2018-12-31 10:08:47,761 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:08:47,762 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c [2018-12-31 10:08:47,780 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5084982f9/9718258e57d1443190b3452585d79a36/FLAGb9bd41057 [2018-12-31 10:08:48,074 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5084982f9/9718258e57d1443190b3452585d79a36 [2018-12-31 10:08:48,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:08:48,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:08:48,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:08:48,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:08:48,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:08:48,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395bd907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48, skipping insertion in model container [2018-12-31 10:08:48,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:08:48,198 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:08:48,502 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:08:48,519 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:08:48,596 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:08:48,628 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:08:48,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48 WrapperNode [2018-12-31 10:08:48,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:08:48,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:08:48,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:08:48,634 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:08:48,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:08:48,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:08:48,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:08:48,856 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:08:48,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... [2018-12-31 10:08:48,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:08:48,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:08:48,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:08:48,971 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:08:48,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2018-12-31 10:08:49,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:08:49,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:08:52,428 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:08:52,429 INFO L280 CfgBuilder]: Removed 163 assue(true) statements. [2018-12-31 10:08:52,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:08:52 BoogieIcfgContainer [2018-12-31 10:08:52,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:08:52,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:08:52,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:08:52,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:08:52,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:08:48" (1/3) ... [2018-12-31 10:08:52,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27db9c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:08:52, skipping insertion in model container [2018-12-31 10:08:52,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:08:48" (2/3) ... [2018-12-31 10:08:52,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27db9c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:08:52, skipping insertion in model container [2018-12-31 10:08:52,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:08:52" (3/3) ... [2018-12-31 10:08:52,455 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.04_false-unreach-call_false-termination.cil.c [2018-12-31 10:08:52,470 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:08:52,486 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-31 10:08:52,509 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-31 10:08:52,558 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:08:52,559 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:08:52,559 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:08:52,559 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:08:52,559 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:08:52,559 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:08:52,560 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:08:52,560 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:08:52,560 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:08:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states. [2018-12-31 10:08:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:52,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:52,620 INFO L402 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] [2018-12-31 10:08:52,624 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:52,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1090379614, now seen corresponding path program 1 times [2018-12-31 10:08:52,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:52,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:52,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:52,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:52,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:52,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:52,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:08:52,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:52,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:52,906 INFO L87 Difference]: Start difference. First operand 421 states. Second operand 3 states. [2018-12-31 10:08:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:53,055 INFO L93 Difference]: Finished difference Result 837 states and 1301 transitions. [2018-12-31 10:08:53,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:53,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:53,091 INFO L225 Difference]: With dead ends: 837 [2018-12-31 10:08:53,091 INFO L226 Difference]: Without dead ends: 417 [2018-12-31 10:08:53,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-31 10:08:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-12-31 10:08:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-31 10:08:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 633 transitions. [2018-12-31 10:08:53,239 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 633 transitions. Word has length 72 [2018-12-31 10:08:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:53,240 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 633 transitions. [2018-12-31 10:08:53,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 633 transitions. [2018-12-31 10:08:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:53,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:53,247 INFO L402 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] [2018-12-31 10:08:53,248 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash 136439456, now seen corresponding path program 1 times [2018-12-31 10:08:53,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:53,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:53,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:53,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:53,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:53,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:53,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:53,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:53,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:53,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:53,446 INFO L87 Difference]: Start difference. First operand 417 states and 633 transitions. Second operand 3 states. [2018-12-31 10:08:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:53,691 INFO L93 Difference]: Finished difference Result 1143 states and 1731 transitions. [2018-12-31 10:08:53,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:53,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:53,704 INFO L225 Difference]: With dead ends: 1143 [2018-12-31 10:08:53,704 INFO L226 Difference]: Without dead ends: 735 [2018-12-31 10:08:53,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-12-31 10:08:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 731. [2018-12-31 10:08:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1106 transitions. [2018-12-31 10:08:53,814 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1106 transitions. Word has length 72 [2018-12-31 10:08:53,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:53,815 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1106 transitions. [2018-12-31 10:08:53,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1106 transitions. [2018-12-31 10:08:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:53,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:53,821 INFO L402 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] [2018-12-31 10:08:53,824 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash -51966948, now seen corresponding path program 1 times [2018-12-31 10:08:53,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:53,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:53,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:53,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:53,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:53,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:53,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:53,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:53,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:53,936 INFO L87 Difference]: Start difference. First operand 731 states and 1106 transitions. Second operand 3 states. [2018-12-31 10:08:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:54,084 INFO L93 Difference]: Finished difference Result 1452 states and 2197 transitions. [2018-12-31 10:08:54,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:54,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:54,093 INFO L225 Difference]: With dead ends: 1452 [2018-12-31 10:08:54,093 INFO L226 Difference]: Without dead ends: 731 [2018-12-31 10:08:54,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-31 10:08:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-31 10:08:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1098 transitions. [2018-12-31 10:08:54,154 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1098 transitions. Word has length 72 [2018-12-31 10:08:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:54,156 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1098 transitions. [2018-12-31 10:08:54,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1098 transitions. [2018-12-31 10:08:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:54,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:54,165 INFO L402 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] [2018-12-31 10:08:54,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:54,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:54,167 INFO L82 PathProgramCache]: Analyzing trace with hash -469363554, now seen corresponding path program 1 times [2018-12-31 10:08:54,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:54,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:54,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:54,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:54,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:54,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:54,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:54,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:54,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:54,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:54,348 INFO L87 Difference]: Start difference. First operand 731 states and 1098 transitions. Second operand 3 states. [2018-12-31 10:08:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:54,544 INFO L93 Difference]: Finished difference Result 1451 states and 2180 transitions. [2018-12-31 10:08:54,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:54,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:54,552 INFO L225 Difference]: With dead ends: 1451 [2018-12-31 10:08:54,552 INFO L226 Difference]: Without dead ends: 731 [2018-12-31 10:08:54,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-31 10:08:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-31 10:08:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1090 transitions. [2018-12-31 10:08:54,607 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1090 transitions. Word has length 72 [2018-12-31 10:08:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:54,611 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1090 transitions. [2018-12-31 10:08:54,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1090 transitions. [2018-12-31 10:08:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:54,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:54,614 INFO L402 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] [2018-12-31 10:08:54,614 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash 428763418, now seen corresponding path program 1 times [2018-12-31 10:08:54,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:54,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:54,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:54,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:54,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:54,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:54,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:54,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:54,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:54,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:54,769 INFO L87 Difference]: Start difference. First operand 731 states and 1090 transitions. Second operand 3 states. [2018-12-31 10:08:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:54,987 INFO L93 Difference]: Finished difference Result 1450 states and 2163 transitions. [2018-12-31 10:08:54,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:54,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:54,997 INFO L225 Difference]: With dead ends: 1450 [2018-12-31 10:08:54,997 INFO L226 Difference]: Without dead ends: 731 [2018-12-31 10:08:55,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-31 10:08:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-31 10:08:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1082 transitions. [2018-12-31 10:08:55,057 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1082 transitions. Word has length 72 [2018-12-31 10:08:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:55,058 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1082 transitions. [2018-12-31 10:08:55,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1082 transitions. [2018-12-31 10:08:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:55,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:55,067 INFO L402 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] [2018-12-31 10:08:55,068 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1481927394, now seen corresponding path program 1 times [2018-12-31 10:08:55,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:55,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:55,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:55,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:55,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:55,208 INFO L87 Difference]: Start difference. First operand 731 states and 1082 transitions. Second operand 3 states. [2018-12-31 10:08:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:55,659 INFO L93 Difference]: Finished difference Result 1448 states and 2144 transitions. [2018-12-31 10:08:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:55,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:55,666 INFO L225 Difference]: With dead ends: 1448 [2018-12-31 10:08:55,666 INFO L226 Difference]: Without dead ends: 731 [2018-12-31 10:08:55,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-31 10:08:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-31 10:08:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1062 transitions. [2018-12-31 10:08:55,723 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1062 transitions. Word has length 72 [2018-12-31 10:08:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:55,723 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1062 transitions. [2018-12-31 10:08:55,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1062 transitions. [2018-12-31 10:08:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:55,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:55,725 INFO L402 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] [2018-12-31 10:08:55,726 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1411017443, now seen corresponding path program 1 times [2018-12-31 10:08:55,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:55,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:55,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:55,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:55,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:55,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:55,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:55,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:55,835 INFO L87 Difference]: Start difference. First operand 731 states and 1062 transitions. Second operand 3 states. [2018-12-31 10:08:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:56,347 INFO L93 Difference]: Finished difference Result 1447 states and 2103 transitions. [2018-12-31 10:08:56,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:56,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:56,358 INFO L225 Difference]: With dead ends: 1447 [2018-12-31 10:08:56,358 INFO L226 Difference]: Without dead ends: 731 [2018-12-31 10:08:56,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-31 10:08:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-31 10:08:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1042 transitions. [2018-12-31 10:08:56,438 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1042 transitions. Word has length 72 [2018-12-31 10:08:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:56,438 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1042 transitions. [2018-12-31 10:08:56,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1042 transitions. [2018-12-31 10:08:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:56,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:56,442 INFO L402 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] [2018-12-31 10:08:56,443 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:56,443 INFO L82 PathProgramCache]: Analyzing trace with hash -149398177, now seen corresponding path program 1 times [2018-12-31 10:08:56,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:56,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:56,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:56,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:56,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:56,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:56,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:56,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:56,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:56,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:56,584 INFO L87 Difference]: Start difference. First operand 731 states and 1042 transitions. Second operand 3 states. [2018-12-31 10:08:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:57,026 INFO L93 Difference]: Finished difference Result 1446 states and 2062 transitions. [2018-12-31 10:08:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:57,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:57,034 INFO L225 Difference]: With dead ends: 1446 [2018-12-31 10:08:57,034 INFO L226 Difference]: Without dead ends: 731 [2018-12-31 10:08:57,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-31 10:08:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-31 10:08:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1022 transitions. [2018-12-31 10:08:57,088 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1022 transitions. Word has length 72 [2018-12-31 10:08:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:57,089 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1022 transitions. [2018-12-31 10:08:57,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1022 transitions. [2018-12-31 10:08:57,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:57,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:57,092 INFO L402 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] [2018-12-31 10:08:57,093 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:57,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:57,094 INFO L82 PathProgramCache]: Analyzing trace with hash -962003548, now seen corresponding path program 1 times [2018-12-31 10:08:57,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:57,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:57,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:57,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:57,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:57,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:57,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:57,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:57,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:57,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:57,195 INFO L87 Difference]: Start difference. First operand 731 states and 1022 transitions. Second operand 3 states. [2018-12-31 10:08:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:57,619 INFO L93 Difference]: Finished difference Result 1445 states and 2021 transitions. [2018-12-31 10:08:57,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:57,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:57,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:57,627 INFO L225 Difference]: With dead ends: 1445 [2018-12-31 10:08:57,627 INFO L226 Difference]: Without dead ends: 731 [2018-12-31 10:08:57,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-31 10:08:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-31 10:08:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1002 transitions. [2018-12-31 10:08:57,679 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1002 transitions. Word has length 72 [2018-12-31 10:08:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:57,679 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1002 transitions. [2018-12-31 10:08:57,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1002 transitions. [2018-12-31 10:08:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:57,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:57,682 INFO L402 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] [2018-12-31 10:08:57,683 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1942397152, now seen corresponding path program 1 times [2018-12-31 10:08:57,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:57,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:57,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:57,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:57,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:57,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:57,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:57,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:57,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:57,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:57,765 INFO L87 Difference]: Start difference. First operand 731 states and 1002 transitions. Second operand 3 states. [2018-12-31 10:08:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:58,199 INFO L93 Difference]: Finished difference Result 1444 states and 1980 transitions. [2018-12-31 10:08:58,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:58,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:58,206 INFO L225 Difference]: With dead ends: 1444 [2018-12-31 10:08:58,207 INFO L226 Difference]: Without dead ends: 731 [2018-12-31 10:08:58,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-31 10:08:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-31 10:08:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 982 transitions. [2018-12-31 10:08:58,259 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 982 transitions. Word has length 72 [2018-12-31 10:08:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:58,259 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 982 transitions. [2018-12-31 10:08:58,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 982 transitions. [2018-12-31 10:08:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:58,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:58,261 INFO L402 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] [2018-12-31 10:08:58,262 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:58,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:58,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1527286429, now seen corresponding path program 1 times [2018-12-31 10:08:58,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:58,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:58,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:58,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:58,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:58,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:58,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:58,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:58,379 INFO L87 Difference]: Start difference. First operand 731 states and 982 transitions. Second operand 3 states. [2018-12-31 10:08:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:58,556 INFO L93 Difference]: Finished difference Result 1449 states and 1946 transitions. [2018-12-31 10:08:58,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:58,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:58,564 INFO L225 Difference]: With dead ends: 1449 [2018-12-31 10:08:58,565 INFO L226 Difference]: Without dead ends: 731 [2018-12-31 10:08:58,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-31 10:08:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-31 10:08:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-31 10:08:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 974 transitions. [2018-12-31 10:08:58,613 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 974 transitions. Word has length 72 [2018-12-31 10:08:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:58,614 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 974 transitions. [2018-12-31 10:08:58,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 974 transitions. [2018-12-31 10:08:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:08:58,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:58,617 INFO L402 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] [2018-12-31 10:08:58,619 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1950032417, now seen corresponding path program 1 times [2018-12-31 10:08:58,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:58,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:58,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:58,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:58,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:58,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:58,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:08:58,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:08:58,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:08:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:58,719 INFO L87 Difference]: Start difference. First operand 731 states and 974 transitions. Second operand 3 states. [2018-12-31 10:08:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:08:59,247 INFO L93 Difference]: Finished difference Result 2078 states and 2774 transitions. [2018-12-31 10:08:59,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:08:59,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:08:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:08:59,260 INFO L225 Difference]: With dead ends: 2078 [2018-12-31 10:08:59,260 INFO L226 Difference]: Without dead ends: 1367 [2018-12-31 10:08:59,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:08:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-12-31 10:08:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1301. [2018-12-31 10:08:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2018-12-31 10:08:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1723 transitions. [2018-12-31 10:08:59,369 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1723 transitions. Word has length 72 [2018-12-31 10:08:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:08:59,370 INFO L480 AbstractCegarLoop]: Abstraction has 1301 states and 1723 transitions. [2018-12-31 10:08:59,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:08:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1723 transitions. [2018-12-31 10:08:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 10:08:59,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:08:59,374 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:08:59,374 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:08:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:08:59,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1262693056, now seen corresponding path program 1 times [2018-12-31 10:08:59,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:08:59,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:08:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:59,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:08:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:08:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:08:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:08:59,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:08:59,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:08:59,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:08:59,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:08:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:08:59,644 INFO L87 Difference]: Start difference. First operand 1301 states and 1723 transitions. Second operand 5 states. [2018-12-31 10:09:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:00,864 INFO L93 Difference]: Finished difference Result 2968 states and 3967 transitions. [2018-12-31 10:09:00,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:09:00,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-12-31 10:09:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:00,880 INFO L225 Difference]: With dead ends: 2968 [2018-12-31 10:09:00,880 INFO L226 Difference]: Without dead ends: 1691 [2018-12-31 10:09:00,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:09:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2018-12-31 10:09:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1307. [2018-12-31 10:09:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2018-12-31 10:09:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1706 transitions. [2018-12-31 10:09:01,026 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1706 transitions. Word has length 117 [2018-12-31 10:09:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:01,030 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1706 transitions. [2018-12-31 10:09:01,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:09:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1706 transitions. [2018-12-31 10:09:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 10:09:01,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:01,034 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:01,036 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:01,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1661445820, now seen corresponding path program 1 times [2018-12-31 10:09:01,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:01,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:01,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:01,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:01,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:01,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:01,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:01,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:01,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:01,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:01,214 INFO L87 Difference]: Start difference. First operand 1307 states and 1706 transitions. Second operand 3 states. [2018-12-31 10:09:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:02,004 INFO L93 Difference]: Finished difference Result 3774 states and 4946 transitions. [2018-12-31 10:09:02,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:02,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-31 10:09:02,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:02,026 INFO L225 Difference]: With dead ends: 3774 [2018-12-31 10:09:02,026 INFO L226 Difference]: Without dead ends: 2493 [2018-12-31 10:09:02,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2018-12-31 10:09:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2377. [2018-12-31 10:09:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-12-31 10:09:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3100 transitions. [2018-12-31 10:09:02,240 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3100 transitions. Word has length 117 [2018-12-31 10:09:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:02,241 INFO L480 AbstractCegarLoop]: Abstraction has 2377 states and 3100 transitions. [2018-12-31 10:09:02,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3100 transitions. [2018-12-31 10:09:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 10:09:02,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:02,247 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:02,247 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:02,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2061437019, now seen corresponding path program 1 times [2018-12-31 10:09:02,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:02,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:02,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:02,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:02,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:02,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:09:02,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:09:02,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:09:02,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:09:02,557 INFO L87 Difference]: Start difference. First operand 2377 states and 3100 transitions. Second operand 5 states. [2018-12-31 10:09:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:04,018 INFO L93 Difference]: Finished difference Result 5178 states and 6787 transitions. [2018-12-31 10:09:04,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:09:04,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-12-31 10:09:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:04,042 INFO L225 Difference]: With dead ends: 5178 [2018-12-31 10:09:04,043 INFO L226 Difference]: Without dead ends: 2831 [2018-12-31 10:09:04,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:09:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2018-12-31 10:09:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2383. [2018-12-31 10:09:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2383 states. [2018-12-31 10:09:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3063 transitions. [2018-12-31 10:09:04,264 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3063 transitions. Word has length 117 [2018-12-31 10:09:04,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:04,265 INFO L480 AbstractCegarLoop]: Abstraction has 2383 states and 3063 transitions. [2018-12-31 10:09:04,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:09:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3063 transitions. [2018-12-31 10:09:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 10:09:04,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:04,272 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:04,273 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:04,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash 672376535, now seen corresponding path program 1 times [2018-12-31 10:09:04,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:04,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:04,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:04,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:04,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:04,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:04,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:09:04,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:09:04,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:09:04,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:09:04,566 INFO L87 Difference]: Start difference. First operand 2383 states and 3063 transitions. Second operand 5 states. [2018-12-31 10:09:04,929 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 10:09:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:05,878 INFO L93 Difference]: Finished difference Result 5747 states and 7403 transitions. [2018-12-31 10:09:05,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:09:05,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-12-31 10:09:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:05,902 INFO L225 Difference]: With dead ends: 5747 [2018-12-31 10:09:05,903 INFO L226 Difference]: Without dead ends: 3401 [2018-12-31 10:09:05,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:09:05,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2018-12-31 10:09:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2395. [2018-12-31 10:09:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2018-12-31 10:09:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3034 transitions. [2018-12-31 10:09:06,333 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3034 transitions. Word has length 117 [2018-12-31 10:09:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:06,335 INFO L480 AbstractCegarLoop]: Abstraction has 2395 states and 3034 transitions. [2018-12-31 10:09:06,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:09:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3034 transitions. [2018-12-31 10:09:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 10:09:06,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:06,341 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:06,343 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2033200557, now seen corresponding path program 1 times [2018-12-31 10:09:06,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:06,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:06,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:06,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:06,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:09:06,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:09:06,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:09:06,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:09:06,660 INFO L87 Difference]: Start difference. First operand 2395 states and 3034 transitions. Second operand 5 states. [2018-12-31 10:09:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:08,123 INFO L93 Difference]: Finished difference Result 6833 states and 8746 transitions. [2018-12-31 10:09:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:09:08,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-12-31 10:09:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:08,151 INFO L225 Difference]: With dead ends: 6833 [2018-12-31 10:09:08,151 INFO L226 Difference]: Without dead ends: 4489 [2018-12-31 10:09:08,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:09:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2018-12-31 10:09:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 2419. [2018-12-31 10:09:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2419 states. [2018-12-31 10:09:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3021 transitions. [2018-12-31 10:09:08,435 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3021 transitions. Word has length 117 [2018-12-31 10:09:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:08,435 INFO L480 AbstractCegarLoop]: Abstraction has 2419 states and 3021 transitions. [2018-12-31 10:09:08,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:09:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3021 transitions. [2018-12-31 10:09:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-31 10:09:08,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:08,441 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:08,442 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:08,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:08,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2118887473, now seen corresponding path program 1 times [2018-12-31 10:09:08,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:08,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:08,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:08,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:08,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:08,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:08,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:08,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:08,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:08,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:08,596 INFO L87 Difference]: Start difference. First operand 2419 states and 3021 transitions. Second operand 3 states. [2018-12-31 10:09:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:09,251 INFO L93 Difference]: Finished difference Result 6877 states and 8545 transitions. [2018-12-31 10:09:09,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:09,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-31 10:09:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:09,300 INFO L225 Difference]: With dead ends: 6877 [2018-12-31 10:09:09,301 INFO L226 Difference]: Without dead ends: 4519 [2018-12-31 10:09:09,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2018-12-31 10:09:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4515. [2018-12-31 10:09:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4515 states. [2018-12-31 10:09:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 5559 transitions. [2018-12-31 10:09:09,833 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 5559 transitions. Word has length 117 [2018-12-31 10:09:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:09,833 INFO L480 AbstractCegarLoop]: Abstraction has 4515 states and 5559 transitions. [2018-12-31 10:09:09,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 5559 transitions. [2018-12-31 10:09:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-31 10:09:09,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:09,840 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:09,841 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1555831778, now seen corresponding path program 1 times [2018-12-31 10:09:09,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:09,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:09,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:09,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:09,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:09,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:09,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:09,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:09,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:09,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:09,983 INFO L87 Difference]: Start difference. First operand 4515 states and 5559 transitions. Second operand 3 states. [2018-12-31 10:09:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:10,808 INFO L93 Difference]: Finished difference Result 12790 states and 15720 transitions. [2018-12-31 10:09:10,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:10,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-12-31 10:09:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:10,848 INFO L225 Difference]: With dead ends: 12790 [2018-12-31 10:09:10,849 INFO L226 Difference]: Without dead ends: 8336 [2018-12-31 10:09:10,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8336 states. [2018-12-31 10:09:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8336 to 8332. [2018-12-31 10:09:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8332 states. [2018-12-31 10:09:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8332 states to 8332 states and 10188 transitions. [2018-12-31 10:09:11,701 INFO L78 Accepts]: Start accepts. Automaton has 8332 states and 10188 transitions. Word has length 118 [2018-12-31 10:09:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:11,701 INFO L480 AbstractCegarLoop]: Abstraction has 8332 states and 10188 transitions. [2018-12-31 10:09:11,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 8332 states and 10188 transitions. [2018-12-31 10:09:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-31 10:09:11,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:11,709 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:11,709 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1011990556, now seen corresponding path program 1 times [2018-12-31 10:09:11,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:11,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:11,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:11,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 10:09:11,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:11,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:11,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:11,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:11,789 INFO L87 Difference]: Start difference. First operand 8332 states and 10188 transitions. Second operand 3 states. [2018-12-31 10:09:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:12,507 INFO L93 Difference]: Finished difference Result 16548 states and 20246 transitions. [2018-12-31 10:09:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:12,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-12-31 10:09:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:12,537 INFO L225 Difference]: With dead ends: 16548 [2018-12-31 10:09:12,537 INFO L226 Difference]: Without dead ends: 8277 [2018-12-31 10:09:12,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2018-12-31 10:09:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 8277. [2018-12-31 10:09:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8277 states. [2018-12-31 10:09:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 10126 transitions. [2018-12-31 10:09:13,305 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 10126 transitions. Word has length 118 [2018-12-31 10:09:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:13,305 INFO L480 AbstractCegarLoop]: Abstraction has 8277 states and 10126 transitions. [2018-12-31 10:09:13,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 10126 transitions. [2018-12-31 10:09:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-31 10:09:13,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:13,315 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:13,316 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash -453804771, now seen corresponding path program 1 times [2018-12-31 10:09:13,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:13,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:13,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:13,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:13,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:13,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:13,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:13,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:13,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:13,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:13,411 INFO L87 Difference]: Start difference. First operand 8277 states and 10126 transitions. Second operand 3 states. [2018-12-31 10:09:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:14,565 INFO L93 Difference]: Finished difference Result 23779 states and 29069 transitions. [2018-12-31 10:09:14,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:14,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2018-12-31 10:09:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:14,624 INFO L225 Difference]: With dead ends: 23779 [2018-12-31 10:09:14,626 INFO L226 Difference]: Without dead ends: 15563 [2018-12-31 10:09:14,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2018-12-31 10:09:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15143. [2018-12-31 10:09:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2018-12-31 10:09:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 18441 transitions. [2018-12-31 10:09:16,179 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 18441 transitions. Word has length 119 [2018-12-31 10:09:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:16,180 INFO L480 AbstractCegarLoop]: Abstraction has 15143 states and 18441 transitions. [2018-12-31 10:09:16,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 18441 transitions. [2018-12-31 10:09:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-31 10:09:16,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:16,192 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:16,193 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2112373853, now seen corresponding path program 1 times [2018-12-31 10:09:16,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:16,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:16,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:16,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:16,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 10:09:16,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:16,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:16,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:16,278 INFO L87 Difference]: Start difference. First operand 15143 states and 18441 transitions. Second operand 3 states. [2018-12-31 10:09:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:17,568 INFO L93 Difference]: Finished difference Result 30188 states and 36773 transitions. [2018-12-31 10:09:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:17,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2018-12-31 10:09:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:17,605 INFO L225 Difference]: With dead ends: 30188 [2018-12-31 10:09:17,605 INFO L226 Difference]: Without dead ends: 15089 [2018-12-31 10:09:17,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15089 states. [2018-12-31 10:09:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15089 to 15089. [2018-12-31 10:09:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15089 states. [2018-12-31 10:09:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15089 states to 15089 states and 18381 transitions. [2018-12-31 10:09:18,984 INFO L78 Accepts]: Start accepts. Automaton has 15089 states and 18381 transitions. Word has length 119 [2018-12-31 10:09:18,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:18,985 INFO L480 AbstractCegarLoop]: Abstraction has 15089 states and 18381 transitions. [2018-12-31 10:09:18,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 15089 states and 18381 transitions. [2018-12-31 10:09:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-31 10:09:18,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:18,997 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:19,000 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash 564824724, now seen corresponding path program 1 times [2018-12-31 10:09:19,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:19,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:19,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:19,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:19,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:19,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:19,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:19,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:19,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:19,131 INFO L87 Difference]: Start difference. First operand 15089 states and 18381 transitions. Second operand 3 states. [2018-12-31 10:09:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:21,353 INFO L93 Difference]: Finished difference Result 42542 states and 51834 transitions. [2018-12-31 10:09:21,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:21,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-12-31 10:09:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:21,427 INFO L225 Difference]: With dead ends: 42542 [2018-12-31 10:09:21,428 INFO L226 Difference]: Without dead ends: 27514 [2018-12-31 10:09:21,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27514 states. [2018-12-31 10:09:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27514 to 27510. [2018-12-31 10:09:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27510 states. [2018-12-31 10:09:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27510 states to 27510 states and 33430 transitions. [2018-12-31 10:09:23,957 INFO L78 Accepts]: Start accepts. Automaton has 27510 states and 33430 transitions. Word has length 120 [2018-12-31 10:09:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:23,958 INFO L480 AbstractCegarLoop]: Abstraction has 27510 states and 33430 transitions. [2018-12-31 10:09:23,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 27510 states and 33430 transitions. [2018-12-31 10:09:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-31 10:09:23,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:23,974 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:23,974 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2002997610, now seen corresponding path program 1 times [2018-12-31 10:09:23,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:23,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:23,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 10:09:24,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:24,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:24,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:24,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:24,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:24,054 INFO L87 Difference]: Start difference. First operand 27510 states and 33430 transitions. Second operand 3 states. [2018-12-31 10:09:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:27,214 INFO L93 Difference]: Finished difference Result 54906 states and 66736 transitions. [2018-12-31 10:09:27,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:27,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-12-31 10:09:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:27,282 INFO L225 Difference]: With dead ends: 54906 [2018-12-31 10:09:27,282 INFO L226 Difference]: Without dead ends: 27457 [2018-12-31 10:09:27,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27457 states. [2018-12-31 10:09:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27457 to 27457. [2018-12-31 10:09:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27457 states. [2018-12-31 10:09:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27457 states to 27457 states and 33372 transitions. [2018-12-31 10:09:29,179 INFO L78 Accepts]: Start accepts. Automaton has 27457 states and 33372 transitions. Word has length 120 [2018-12-31 10:09:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:29,180 INFO L480 AbstractCegarLoop]: Abstraction has 27457 states and 33372 transitions. [2018-12-31 10:09:29,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 27457 states and 33372 transitions. [2018-12-31 10:09:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-31 10:09:29,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:29,193 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:29,193 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash 933474923, now seen corresponding path program 1 times [2018-12-31 10:09:29,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:29,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:29,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:29,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:29,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:29,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:29,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:29,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:29,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:29,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:29,301 INFO L87 Difference]: Start difference. First operand 27457 states and 33372 transitions. Second operand 3 states. [2018-12-31 10:09:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:33,313 INFO L93 Difference]: Finished difference Result 78974 states and 95659 transitions. [2018-12-31 10:09:33,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:33,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-12-31 10:09:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:33,434 INFO L225 Difference]: With dead ends: 78974 [2018-12-31 10:09:33,434 INFO L226 Difference]: Without dead ends: 39641 [2018-12-31 10:09:33,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39641 states. [2018-12-31 10:09:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39641 to 39641. [2018-12-31 10:09:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39641 states. [2018-12-31 10:09:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39641 states to 39641 states and 47863 transitions. [2018-12-31 10:09:36,710 INFO L78 Accepts]: Start accepts. Automaton has 39641 states and 47863 transitions. Word has length 121 [2018-12-31 10:09:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:36,711 INFO L480 AbstractCegarLoop]: Abstraction has 39641 states and 47863 transitions. [2018-12-31 10:09:36,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 39641 states and 47863 transitions. [2018-12-31 10:09:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-31 10:09:36,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:36,737 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:36,738 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:36,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:36,738 INFO L82 PathProgramCache]: Analyzing trace with hash 334867575, now seen corresponding path program 1 times [2018-12-31 10:09:36,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:36,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:36,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:36,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:36,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:36,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:36,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:09:36,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:36,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:36,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:36,855 INFO L87 Difference]: Start difference. First operand 39641 states and 47863 transitions. Second operand 3 states. [2018-12-31 10:09:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:41,109 INFO L93 Difference]: Finished difference Result 91203 states and 109883 transitions. [2018-12-31 10:09:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:41,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2018-12-31 10:09:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:41,246 INFO L225 Difference]: With dead ends: 91203 [2018-12-31 10:09:41,247 INFO L226 Difference]: Without dead ends: 51608 [2018-12-31 10:09:41,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51608 states. [2018-12-31 10:09:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51608 to 51416. [2018-12-31 10:09:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51416 states. [2018-12-31 10:09:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51416 states to 51416 states and 61605 transitions. [2018-12-31 10:09:45,050 INFO L78 Accepts]: Start accepts. Automaton has 51416 states and 61605 transitions. Word has length 156 [2018-12-31 10:09:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:45,051 INFO L480 AbstractCegarLoop]: Abstraction has 51416 states and 61605 transitions. [2018-12-31 10:09:45,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 51416 states and 61605 transitions. [2018-12-31 10:09:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-31 10:09:45,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:45,098 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:45,098 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash -67611790, now seen corresponding path program 1 times [2018-12-31 10:09:45,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:45,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:45,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:45,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-31 10:09:45,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:45,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:45,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:45,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:45,253 INFO L87 Difference]: Start difference. First operand 51416 states and 61605 transitions. Second operand 3 states. [2018-12-31 10:09:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:49,710 INFO L93 Difference]: Finished difference Result 101872 states and 121803 transitions. [2018-12-31 10:09:49,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:49,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-31 10:09:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:49,856 INFO L225 Difference]: With dead ends: 101872 [2018-12-31 10:09:49,856 INFO L226 Difference]: Without dead ends: 50516 [2018-12-31 10:09:49,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50516 states. [2018-12-31 10:09:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50516 to 50516. [2018-12-31 10:09:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50516 states. [2018-12-31 10:09:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50516 states to 50516 states and 59621 transitions. [2018-12-31 10:09:54,363 INFO L78 Accepts]: Start accepts. Automaton has 50516 states and 59621 transitions. Word has length 174 [2018-12-31 10:09:54,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:09:54,364 INFO L480 AbstractCegarLoop]: Abstraction has 50516 states and 59621 transitions. [2018-12-31 10:09:54,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:09:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 50516 states and 59621 transitions. [2018-12-31 10:09:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-31 10:09:54,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:09:54,409 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:09:54,409 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:09:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:09:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1145557634, now seen corresponding path program 1 times [2018-12-31 10:09:54,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:09:54,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:09:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:54,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:09:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:09:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:09:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:09:54,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:09:54,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:09:54,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:09:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:09:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:54,543 INFO L87 Difference]: Start difference. First operand 50516 states and 59621 transitions. Second operand 3 states. [2018-12-31 10:09:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:09:57,788 INFO L93 Difference]: Finished difference Result 89380 states and 105829 transitions. [2018-12-31 10:09:57,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:09:57,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-12-31 10:09:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:09:57,861 INFO L225 Difference]: With dead ends: 89380 [2018-12-31 10:09:57,861 INFO L226 Difference]: Without dead ends: 50520 [2018-12-31 10:09:57,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:09:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50520 states. [2018-12-31 10:10:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50520 to 50516. [2018-12-31 10:10:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50516 states. [2018-12-31 10:10:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50516 states to 50516 states and 59513 transitions. [2018-12-31 10:10:01,549 INFO L78 Accepts]: Start accepts. Automaton has 50516 states and 59513 transitions. Word has length 175 [2018-12-31 10:10:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:01,550 INFO L480 AbstractCegarLoop]: Abstraction has 50516 states and 59513 transitions. [2018-12-31 10:10:01,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:10:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 50516 states and 59513 transitions. [2018-12-31 10:10:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-31 10:10:01,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:01,589 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:10:01,589 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:01,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2011308056, now seen corresponding path program 1 times [2018-12-31 10:10:01,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:01,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:01,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:01,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:01,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-31 10:10:01,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:01,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:10:01,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:10:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:10:01,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:01,742 INFO L87 Difference]: Start difference. First operand 50516 states and 59513 transitions. Second operand 3 states. [2018-12-31 10:10:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:08,908 INFO L93 Difference]: Finished difference Result 111624 states and 131256 transitions. [2018-12-31 10:10:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:10:08,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-12-31 10:10:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:09,063 INFO L225 Difference]: With dead ends: 111624 [2018-12-31 10:10:09,064 INFO L226 Difference]: Without dead ends: 61147 [2018-12-31 10:10:09,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61147 states. [2018-12-31 10:10:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61147 to 60891. [2018-12-31 10:10:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60891 states. [2018-12-31 10:10:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 71287 transitions. [2018-12-31 10:10:13,302 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 71287 transitions. Word has length 210 [2018-12-31 10:10:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:13,303 INFO L480 AbstractCegarLoop]: Abstraction has 60891 states and 71287 transitions. [2018-12-31 10:10:13,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:10:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 71287 transitions. [2018-12-31 10:10:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-31 10:10:13,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:13,382 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:10:13,383 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:13,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1782699020, now seen corresponding path program 1 times [2018-12-31 10:10:13,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:13,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:13,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:13,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:10:13,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:13,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:10:13,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:10:13,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:10:13,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:13,519 INFO L87 Difference]: Start difference. First operand 60891 states and 71287 transitions. Second operand 3 states. [2018-12-31 10:10:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:19,149 INFO L93 Difference]: Finished difference Result 111351 states and 130739 transitions. [2018-12-31 10:10:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:10:19,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-12-31 10:10:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:19,326 INFO L225 Difference]: With dead ends: 111351 [2018-12-31 10:10:19,327 INFO L226 Difference]: Without dead ends: 60895 [2018-12-31 10:10:19,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60895 states. [2018-12-31 10:10:24,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60895 to 60891. [2018-12-31 10:10:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60891 states. [2018-12-31 10:10:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 71123 transitions. [2018-12-31 10:10:24,941 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 71123 transitions. Word has length 213 [2018-12-31 10:10:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:24,941 INFO L480 AbstractCegarLoop]: Abstraction has 60891 states and 71123 transitions. [2018-12-31 10:10:24,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:10:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 71123 transitions. [2018-12-31 10:10:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-31 10:10:25,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:25,003 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:10:25,003 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:25,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:25,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1923880001, now seen corresponding path program 1 times [2018-12-31 10:10:25,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:25,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:25,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:10:25,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:25,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:10:25,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:10:25,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:10:25,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:25,129 INFO L87 Difference]: Start difference. First operand 60891 states and 71123 transitions. Second operand 3 states. [2018-12-31 10:10:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:29,620 INFO L93 Difference]: Finished difference Result 111475 states and 130537 transitions. [2018-12-31 10:10:29,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:10:29,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-12-31 10:10:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:29,812 INFO L225 Difference]: With dead ends: 111475 [2018-12-31 10:10:29,812 INFO L226 Difference]: Without dead ends: 61019 [2018-12-31 10:10:29,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61019 states. [2018-12-31 10:10:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61019 to 60891. [2018-12-31 10:10:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60891 states. [2018-12-31 10:10:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 69971 transitions. [2018-12-31 10:10:35,207 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 69971 transitions. Word has length 213 [2018-12-31 10:10:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:35,208 INFO L480 AbstractCegarLoop]: Abstraction has 60891 states and 69971 transitions. [2018-12-31 10:10:35,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:10:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 69971 transitions. [2018-12-31 10:10:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-31 10:10:35,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:35,262 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:10:35,263 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:35,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1073074581, now seen corresponding path program 1 times [2018-12-31 10:10:35,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:35,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:35,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:35,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:35,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:10:35,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:35,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:10:35,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:10:35,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:10:35,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:10:35,443 INFO L87 Difference]: Start difference. First operand 60891 states and 69971 transitions. Second operand 5 states. [2018-12-31 10:10:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:43,331 INFO L93 Difference]: Finished difference Result 154915 states and 179281 transitions. [2018-12-31 10:10:43,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:10:43,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2018-12-31 10:10:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:43,601 INFO L225 Difference]: With dead ends: 154915 [2018-12-31 10:10:43,601 INFO L226 Difference]: Without dead ends: 94067 [2018-12-31 10:10:43,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:10:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94067 states. [2018-12-31 10:10:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94067 to 61275. [2018-12-31 10:10:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61275 states. [2018-12-31 10:10:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61275 states to 61275 states and 69410 transitions. [2018-12-31 10:10:49,370 INFO L78 Accepts]: Start accepts. Automaton has 61275 states and 69410 transitions. Word has length 216 [2018-12-31 10:10:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:10:49,370 INFO L480 AbstractCegarLoop]: Abstraction has 61275 states and 69410 transitions. [2018-12-31 10:10:49,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:10:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 61275 states and 69410 transitions. [2018-12-31 10:10:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-31 10:10:49,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:10:49,415 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:10:49,415 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:10:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:10:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1497272560, now seen corresponding path program 1 times [2018-12-31 10:10:49,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:10:49,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:10:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:49,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:10:49,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:10:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:10:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 10:10:49,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:10:49,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 10:10:49,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:10:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:10:49,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:49,564 INFO L87 Difference]: Start difference. First operand 61275 states and 69410 transitions. Second operand 3 states. [2018-12-31 10:10:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:10:55,252 INFO L93 Difference]: Finished difference Result 131965 states and 149290 transitions. [2018-12-31 10:10:55,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:10:55,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-12-31 10:10:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:10:55,440 INFO L225 Difference]: With dead ends: 131965 [2018-12-31 10:10:55,441 INFO L226 Difference]: Without dead ends: 70722 [2018-12-31 10:10:55,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:10:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70722 states. [2018-12-31 10:11:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70722 to 70402. [2018-12-31 10:11:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70402 states. [2018-12-31 10:11:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70402 states to 70402 states and 79384 transitions. [2018-12-31 10:11:01,955 INFO L78 Accepts]: Start accepts. Automaton has 70402 states and 79384 transitions. Word has length 250 [2018-12-31 10:11:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:01,956 INFO L480 AbstractCegarLoop]: Abstraction has 70402 states and 79384 transitions. [2018-12-31 10:11:01,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 70402 states and 79384 transitions. [2018-12-31 10:11:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-31 10:11:02,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:02,032 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:11:02,033 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:02,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:02,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1211305274, now seen corresponding path program 1 times [2018-12-31 10:11:02,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:02,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:02,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:02,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:02,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:11:02,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:02,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:11:02,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:11:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:11:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:02,191 INFO L87 Difference]: Start difference. First operand 70402 states and 79384 transitions. Second operand 3 states. [2018-12-31 10:11:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:10,206 INFO L93 Difference]: Finished difference Result 131622 states and 148736 transitions. [2018-12-31 10:11:10,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:11:10,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-12-31 10:11:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:10,413 INFO L225 Difference]: With dead ends: 131622 [2018-12-31 10:11:10,413 INFO L226 Difference]: Without dead ends: 70406 [2018-12-31 10:11:10,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70406 states. [2018-12-31 10:11:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70406 to 70402. [2018-12-31 10:11:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70402 states. [2018-12-31 10:11:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70402 states to 70402 states and 79128 transitions. [2018-12-31 10:11:16,308 INFO L78 Accepts]: Start accepts. Automaton has 70402 states and 79128 transitions. Word has length 253 [2018-12-31 10:11:16,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:16,309 INFO L480 AbstractCegarLoop]: Abstraction has 70402 states and 79128 transitions. [2018-12-31 10:11:16,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 70402 states and 79128 transitions. [2018-12-31 10:11:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-31 10:11:16,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:16,379 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:11:16,380 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash 78021096, now seen corresponding path program 1 times [2018-12-31 10:11:16,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:16,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:16,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:16,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:16,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 10:11:16,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:16,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:11:16,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:11:16,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:11:16,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:16,539 INFO L87 Difference]: Start difference. First operand 70402 states and 79128 transitions. Second operand 3 states. [2018-12-31 10:11:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:19,718 INFO L93 Difference]: Finished difference Result 91476 states and 102378 transitions. [2018-12-31 10:11:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:11:19,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-12-31 10:11:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:19,746 INFO L225 Difference]: With dead ends: 91476 [2018-12-31 10:11:19,746 INFO L226 Difference]: Without dead ends: 10928 [2018-12-31 10:11:19,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10928 states. [2018-12-31 10:11:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10928 to 10920. [2018-12-31 10:11:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2018-12-31 10:11:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 11793 transitions. [2018-12-31 10:11:20,665 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 11793 transitions. Word has length 292 [2018-12-31 10:11:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:20,665 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 11793 transitions. [2018-12-31 10:11:20,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 11793 transitions. [2018-12-31 10:11:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-31 10:11:20,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:20,683 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:11:20,684 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -394404878, now seen corresponding path program 1 times [2018-12-31 10:11:20,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:20,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:20,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:20,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:11:20,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:20,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:11:20,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:11:20,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:11:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:20,856 INFO L87 Difference]: Start difference. First operand 10920 states and 11793 transitions. Second operand 3 states. [2018-12-31 10:11:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:22,117 INFO L93 Difference]: Finished difference Result 18698 states and 20230 transitions. [2018-12-31 10:11:22,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:11:22,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2018-12-31 10:11:22,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:22,134 INFO L225 Difference]: With dead ends: 18698 [2018-12-31 10:11:22,134 INFO L226 Difference]: Without dead ends: 10920 [2018-12-31 10:11:22,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2018-12-31 10:11:22,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 10920. [2018-12-31 10:11:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2018-12-31 10:11:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 11685 transitions. [2018-12-31 10:11:22,901 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 11685 transitions. Word has length 293 [2018-12-31 10:11:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:22,902 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 11685 transitions. [2018-12-31 10:11:22,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 11685 transitions. [2018-12-31 10:11:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-12-31 10:11:22,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:22,917 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:11:22,918 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:22,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash 526279388, now seen corresponding path program 1 times [2018-12-31 10:11:22,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:22,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:22,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:22,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:11:23,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:23,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:11:23,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:11:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:11:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:23,080 INFO L87 Difference]: Start difference. First operand 10920 states and 11685 transitions. Second operand 3 states. [2018-12-31 10:11:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:24,019 INFO L93 Difference]: Finished difference Result 16951 states and 18170 transitions. [2018-12-31 10:11:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:11:24,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-12-31 10:11:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:24,046 INFO L225 Difference]: With dead ends: 16951 [2018-12-31 10:11:24,047 INFO L226 Difference]: Without dead ends: 10920 [2018-12-31 10:11:24,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2018-12-31 10:11:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 10920. [2018-12-31 10:11:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2018-12-31 10:11:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 11599 transitions. [2018-12-31 10:11:24,922 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 11599 transitions. Word has length 297 [2018-12-31 10:11:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:24,923 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 11599 transitions. [2018-12-31 10:11:24,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 11599 transitions. [2018-12-31 10:11:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-12-31 10:11:24,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:24,940 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:11:24,941 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:24,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:24,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1535852850, now seen corresponding path program 1 times [2018-12-31 10:11:24,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:24,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:24,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:11:25,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:25,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:11:25,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:11:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:11:25,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:25,121 INFO L87 Difference]: Start difference. First operand 10920 states and 11599 transitions. Second operand 3 states. [2018-12-31 10:11:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:26,472 INFO L93 Difference]: Finished difference Result 17684 states and 18802 transitions. [2018-12-31 10:11:26,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:11:26,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2018-12-31 10:11:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:26,495 INFO L225 Difference]: With dead ends: 17684 [2018-12-31 10:11:26,496 INFO L226 Difference]: Without dead ends: 10984 [2018-12-31 10:11:26,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10984 states. [2018-12-31 10:11:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10984 to 10920. [2018-12-31 10:11:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2018-12-31 10:11:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 11501 transitions. [2018-12-31 10:11:27,343 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 11501 transitions. Word has length 301 [2018-12-31 10:11:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:27,343 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 11501 transitions. [2018-12-31 10:11:27,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 11501 transitions. [2018-12-31 10:11:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-12-31 10:11:27,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:27,360 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:11:27,361 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash 185562899, now seen corresponding path program 1 times [2018-12-31 10:11:27,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:27,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:27,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:11:27,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:27,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:11:27,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:11:27,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:11:27,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:27,539 INFO L87 Difference]: Start difference. First operand 10920 states and 11501 transitions. Second operand 3 states. [2018-12-31 10:11:28,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:28,333 INFO L93 Difference]: Finished difference Result 13691 states and 14419 transitions. [2018-12-31 10:11:28,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:11:28,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2018-12-31 10:11:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:28,354 INFO L225 Difference]: With dead ends: 13691 [2018-12-31 10:11:28,354 INFO L226 Difference]: Without dead ends: 8725 [2018-12-31 10:11:28,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8725 states. [2018-12-31 10:11:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8725 to 8725. [2018-12-31 10:11:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8725 states. [2018-12-31 10:11:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8725 states to 8725 states and 9171 transitions. [2018-12-31 10:11:29,031 INFO L78 Accepts]: Start accepts. Automaton has 8725 states and 9171 transitions. Word has length 304 [2018-12-31 10:11:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:29,032 INFO L480 AbstractCegarLoop]: Abstraction has 8725 states and 9171 transitions. [2018-12-31 10:11:29,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8725 states and 9171 transitions. [2018-12-31 10:11:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-12-31 10:11:29,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:29,047 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:11:29,047 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:29,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1149032847, now seen corresponding path program 1 times [2018-12-31 10:11:29,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:29,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:29,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:29,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:29,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:11:29,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:29,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 10:11:29,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:11:29,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:11:29,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:11:29,533 INFO L87 Difference]: Start difference. First operand 8725 states and 9171 transitions. Second operand 7 states. [2018-12-31 10:11:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:30,463 INFO L93 Difference]: Finished difference Result 8725 states and 9171 transitions. [2018-12-31 10:11:30,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 10:11:30,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 308 [2018-12-31 10:11:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:30,490 INFO L225 Difference]: With dead ends: 8725 [2018-12-31 10:11:30,492 INFO L226 Difference]: Without dead ends: 8723 [2018-12-31 10:11:30,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:11:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2018-12-31 10:11:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 8723. [2018-12-31 10:11:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8723 states. [2018-12-31 10:11:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8723 states to 8723 states and 9168 transitions. [2018-12-31 10:11:31,232 INFO L78 Accepts]: Start accepts. Automaton has 8723 states and 9168 transitions. Word has length 308 [2018-12-31 10:11:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:31,233 INFO L480 AbstractCegarLoop]: Abstraction has 8723 states and 9168 transitions. [2018-12-31 10:11:31,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:11:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 8723 states and 9168 transitions. [2018-12-31 10:11:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-12-31 10:11:31,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:31,245 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:11:31,245 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:31,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1404905635, now seen corresponding path program 1 times [2018-12-31 10:11:31,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:31,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:31,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:11:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-31 10:11:31,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:11:31,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:11:31,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:11:31,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:11:31,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:31,438 INFO L87 Difference]: Start difference. First operand 8723 states and 9168 transitions. Second operand 3 states. [2018-12-31 10:11:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:11:32,312 INFO L93 Difference]: Finished difference Result 11851 states and 12417 transitions. [2018-12-31 10:11:32,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:11:32,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-12-31 10:11:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:11:32,330 INFO L225 Difference]: With dead ends: 11851 [2018-12-31 10:11:32,330 INFO L226 Difference]: Without dead ends: 10279 [2018-12-31 10:11:32,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:11:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2018-12-31 10:11:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 8725. [2018-12-31 10:11:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8725 states. [2018-12-31 10:11:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8725 states to 8725 states and 9170 transitions. [2018-12-31 10:11:33,115 INFO L78 Accepts]: Start accepts. Automaton has 8725 states and 9170 transitions. Word has length 312 [2018-12-31 10:11:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:11:33,117 INFO L480 AbstractCegarLoop]: Abstraction has 8725 states and 9170 transitions. [2018-12-31 10:11:33,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:11:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 8725 states and 9170 transitions. [2018-12-31 10:11:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-12-31 10:11:33,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:11:33,134 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:11:33,134 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:11:33,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:11:33,135 INFO L82 PathProgramCache]: Analyzing trace with hash -839838432, now seen corresponding path program 1 times [2018-12-31 10:11:33,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:11:33,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:11:33,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:33,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:11:33,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:11:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:11:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:11:33,407 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 10:11:33,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:11:33 BoogieIcfgContainer [2018-12-31 10:11:33,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:11:33,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:11:33,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:11:33,679 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:11:33,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:08:52" (3/4) ... [2018-12-31 10:11:33,685 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 10:11:34,025 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:11:34,026 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:11:34,029 INFO L168 Benchmark]: Toolchain (without parser) took 165941.56 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 946.0 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-31 10:11:34,031 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:11:34,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.70 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 10:11:34,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 222.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-31 10:11:34,032 INFO L168 Benchmark]: Boogie Preprocessor took 113.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-31 10:11:34,032 INFO L168 Benchmark]: RCFGBuilder took 3460.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 88.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 11.5 GB. [2018-12-31 10:11:34,032 INFO L168 Benchmark]: TraceAbstraction took 161243.95 ms. Allocated memory was 1.1 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 995.3 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 946.4 MB. Max. memory is 11.5 GB. [2018-12-31 10:11:34,037 INFO L168 Benchmark]: Witness Printer took 347.02 ms. Allocated memory is still 5.5 GB. Free memory is still 4.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:11:34,039 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 536.70 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 222.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3460.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 88.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 161243.95 ms. Allocated memory was 1.1 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 995.3 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 946.4 MB. Max. memory is 11.5 GB. * Witness Printer took 347.02 ms. Allocated memory is still 5.5 GB. Free memory is still 4.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int t3_pc = 0; [L18] int t4_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int t3_st ; [L23] int t4_st ; [L24] int m_i ; [L25] int t1_i ; [L26] int t2_i ; [L27] int t3_i ; [L28] int t4_i ; [L29] int M_E = 2; [L30] int T1_E = 2; [L31] int T2_E = 2; [L32] int T3_E = 2; [L33] int T4_E = 2; [L34] int E_M = 2; [L35] int E_1 = 2; [L36] int E_2 = 2; [L37] int E_3 = 2; [L38] int E_4 = 2; [L45] int token ; [L47] int local ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, token=0] [L850] int __retres1 ; [L762] m_i = 1 [L763] t1_i = 1 [L764] t2_i = 1 [L765] t3_i = 1 [L766] t4_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L791] int kernel_st ; [L792] int tmp ; [L793] int tmp___0 ; [L797] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L355] COND TRUE m_i == 1 [L356] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L360] COND TRUE t1_i == 1 [L361] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L365] COND TRUE t2_i == 1 [L366] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L370] COND TRUE t3_i == 1 [L371] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L375] COND TRUE t4_i == 1 [L376] t4_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L516] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L521] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L526] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L531] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L536] COND FALSE !(T4_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L541] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L546] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L551] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L556] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L561] COND FALSE !(E_4 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L252] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L262] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L264] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L271] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L283] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L290] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L302] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L309] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L321] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L328] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L338] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L340] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L574] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L579] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L584] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L589] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L594] COND FALSE !(T4_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L599] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L604] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L609] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L614] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L619] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L805] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L808] kernel_st = 1 [L421] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L425] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L385] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L388] COND TRUE m_st == 0 [L389] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L416] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L428] tmp = exists_runnable_thread() [L430] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L435] COND TRUE m_st == 0 [L436] int tmp_ndt_1; [L437] tmp_ndt_1 = __VERIFIER_nondet_int() [L438] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L449] COND TRUE t1_st == 0 [L450] int tmp_ndt_2; [L451] tmp_ndt_2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp_ndt_2) [L454] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L108] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L119] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L121] t1_pc = 1 [L122] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L463] COND TRUE t2_st == 0 [L464] int tmp_ndt_3; [L465] tmp_ndt_3 = __VERIFIER_nondet_int() [L466] COND TRUE \read(tmp_ndt_3) [L468] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L144] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L155] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L157] t2_pc = 1 [L158] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L477] COND TRUE t3_st == 0 [L478] int tmp_ndt_4; [L479] tmp_ndt_4 = __VERIFIER_nondet_int() [L480] COND TRUE \read(tmp_ndt_4) [L482] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L180] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L191] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L193] t3_pc = 1 [L194] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=0, token=0] [L491] COND TRUE t4_st == 0 [L492] int tmp_ndt_5; [L493] tmp_ndt_5 = __VERIFIER_nondet_int() [L494] COND TRUE \read(tmp_ndt_5) [L496] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L216] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L227] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1, token=0] [L229] t4_pc = 1 [L230] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L425] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L385] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L388] COND TRUE m_st == 0 [L389] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L416] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L428] tmp = exists_runnable_thread() [L430] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L435] COND TRUE m_st == 0 [L436] int tmp_ndt_1; [L437] tmp_ndt_1 = __VERIFIER_nondet_int() [L438] COND TRUE \read(tmp_ndt_1) [L440] m_st = 1 [L50] int tmp_var = __VERIFIER_nondet_int(); [L52] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L63] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L66] token = __VERIFIER_nondet_int() [L67] local = token [L68] E_1 = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L252] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L262] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L264] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L268] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L271] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L272] COND TRUE E_1 == 1 [L273] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L283] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L645] tmp___0 = is_transmit1_triggered() [L647] COND TRUE \read(tmp___0) [L648] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L287] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L290] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L291] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L300] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L302] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L306] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L309] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L310] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L319] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L321] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L325] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L328] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L329] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L338] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L340] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L70] E_1 = 2 [L71] m_pc = 1 [L72] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L449] COND TRUE t1_st == 0 [L450] int tmp_ndt_2; [L451] tmp_ndt_2 = __VERIFIER_nondet_int() [L452] COND TRUE \read(tmp_ndt_2) [L454] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L108] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L111] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=0] [L127] token += 1 [L128] E_2 = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L252] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L253] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L262] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L264] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L268] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L271] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L272] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L281] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L283] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L287] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L290] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L291] COND TRUE E_2 == 1 [L292] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L302] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L653] tmp___1 = is_transmit2_triggered() [L655] COND TRUE \read(tmp___1) [L656] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L306] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L309] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L310] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L319] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L321] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L325] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L328] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L329] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L338] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L340] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L130] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L119] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L121] t1_pc = 1 [L122] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L463] COND TRUE t2_st == 0 [L464] int tmp_ndt_3; [L465] tmp_ndt_3 = __VERIFIER_nondet_int() [L466] COND TRUE \read(tmp_ndt_3) [L468] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L144] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L147] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=1] [L163] token += 1 [L164] E_3 = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L252] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L253] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L262] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L264] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L271] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L272] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L283] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L290] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L291] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L302] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L309] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L310] COND TRUE E_3 == 1 [L311] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L321] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L661] tmp___2 = is_transmit3_triggered() [L663] COND TRUE \read(tmp___2) [L664] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L328] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L329] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L338] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L340] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L166] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L155] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L157] t2_pc = 1 [L158] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L477] COND TRUE t3_st == 0 [L478] int tmp_ndt_4; [L479] tmp_ndt_4 = __VERIFIER_nondet_int() [L480] COND TRUE \read(tmp_ndt_4) [L482] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L180] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L183] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=2] [L199] token += 1 [L200] E_4 = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L252] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L253] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L262] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L264] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L637] tmp = is_master_triggered() [L639] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L271] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L272] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L283] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L290] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L291] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L302] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L309] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L310] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L321] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L328] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L329] COND TRUE E_4 == 1 [L330] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L340] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=3] [L669] tmp___3 = is_transmit4_triggered() [L671] COND TRUE \read(tmp___3) [L672] t4_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=3] [L202] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=3] [L191] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=3] [L193] t3_pc = 1 [L194] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=0, token=3] [L491] COND TRUE t4_st == 0 [L492] int tmp_ndt_5; [L493] tmp_ndt_5 = __VERIFIER_nondet_int() [L494] COND TRUE \read(tmp_ndt_5) [L496] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=3] [L216] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=3] [L219] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=3] [L235] token += 1 [L236] E_M = 1 [L629] int tmp ; [L630] int tmp___0 ; [L631] int tmp___1 ; [L632] int tmp___2 ; [L633] int tmp___3 ; [L249] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L252] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L253] COND TRUE E_M == 1 [L254] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L264] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L637] tmp = is_master_triggered() [L639] COND TRUE \read(tmp) [L640] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L268] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L271] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L272] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L281] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L283] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L645] tmp___0 = is_transmit1_triggered() [L647] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L287] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L290] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L291] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L300] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L302] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L653] tmp___1 = is_transmit2_triggered() [L655] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L306] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L309] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L310] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L319] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L321] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L661] tmp___2 = is_transmit3_triggered() [L663] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L325] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L328] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L329] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L338] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L340] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L669] tmp___3 = is_transmit4_triggered() [L671] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L238] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L227] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1, token=4] [L229] t4_pc = 1 [L230] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L425] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L385] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L388] COND TRUE m_st == 0 [L389] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L416] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L428] tmp = exists_runnable_thread() [L430] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L435] COND TRUE m_st == 0 [L436] int tmp_ndt_1; [L437] tmp_ndt_1 = __VERIFIER_nondet_int() [L438] COND TRUE \read(tmp_ndt_1) [L440] m_st = 1 [L50] int tmp_var = __VERIFIER_nondet_int(); [L52] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L55] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L77] COND FALSE !(token != local + 4) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L82] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L83] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L88] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L89] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L90] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2, token=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 421 locations, 2 error locations. UNSAFE Result, 161.1s OverallTime, 42 OverallIterations, 3 TraceHistogramMax, 88.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25645 SDtfs, 22698 SDslu, 18605 SDs, 0 SdLazy, 805 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70402occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 64.5s AutomataMinimizationTime, 41 MinimizatonAttempts, 39852 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 6681 NumberOfCodeBlocks, 6681 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 6327 ConstructedInterpolants, 0 QuantifiedInterpolants, 2308189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 733/733 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...