./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 0ed9222f 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-0ed9222-m [2019-01-12 15:13:18,168 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:13:18,170 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:13:18,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:13:18,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:13:18,190 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:13:18,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:13:18,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:13:18,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:13:18,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:13:18,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:13:18,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:13:18,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:13:18,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:13:18,205 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:13:18,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:13:18,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:13:18,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:13:18,222 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:13:18,224 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:13:18,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:13:18,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:13:18,231 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:13:18,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:13:18,232 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:13:18,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:13:18,235 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:13:18,237 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:13:18,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:13:18,240 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:13:18,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:13:18,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:13:18,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:13:18,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:13:18,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:13:18,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:13:18,248 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:13:18,276 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:13:18,276 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:13:18,278 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:13:18,283 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:13:18,283 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:13:18,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:13:18,283 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:13:18,284 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:13:18,284 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:13:18,284 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:13:18,284 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:13:18,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:13:18,284 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:13:18,284 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:13:18,286 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:13:18,286 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:13:18,286 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:13:18,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:13:18,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:13:18,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:13:18,288 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:13:18,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:13:18,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:13:18,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:13:18,290 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:13:18,290 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:13:18,290 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:13:18,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:13:18,291 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 [2019-01-12 15:13:18,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:13:18,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:13:18,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:13:18,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:13:18,371 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:13:18,372 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c [2019-01-12 15:13:18,444 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb47f566/bd862ac5e30144d8944128df06063bdb/FLAG9040575aa [2019-01-12 15:13:18,925 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:13:18,928 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/token_ring.04_false-unreach-call_false-termination.cil.c [2019-01-12 15:13:18,952 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb47f566/bd862ac5e30144d8944128df06063bdb/FLAG9040575aa [2019-01-12 15:13:19,452 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb47f566/bd862ac5e30144d8944128df06063bdb [2019-01-12 15:13:19,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:13:19,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:13:19,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:13:19,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:13:19,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:13:19,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:19,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc9bcbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19, skipping insertion in model container [2019-01-12 15:13:19,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:19,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:13:19,538 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:13:19,835 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:13:19,842 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:13:19,903 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:13:19,931 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:13:19,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19 WrapperNode [2019-01-12 15:13:19,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:13:19,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:13:19,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:13:19,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:13:20,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:20,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:20,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:13:20,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:13:20,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:13:20,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:13:20,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:20,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:20,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:20,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:20,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:20,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:20,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (1/1) ... [2019-01-12 15:13:20,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:13:20,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:13:20,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:13:20,185 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:13:20,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (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 [2019-01-12 15:13:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:13:20,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:13:22,863 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:13:22,863 INFO L286 CfgBuilder]: Removed 163 assue(true) statements. [2019-01-12 15:13:22,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:13:22 BoogieIcfgContainer [2019-01-12 15:13:22,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:13:22,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:13:22,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:13:22,870 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:13:22,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:13:19" (1/3) ... [2019-01-12 15:13:22,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a522fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:13:22, skipping insertion in model container [2019-01-12 15:13:22,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:13:19" (2/3) ... [2019-01-12 15:13:22,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a522fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:13:22, skipping insertion in model container [2019-01-12 15:13:22,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:13:22" (3/3) ... [2019-01-12 15:13:22,874 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.04_false-unreach-call_false-termination.cil.c [2019-01-12 15:13:22,885 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:13:22,896 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 15:13:22,914 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 15:13:22,952 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:13:22,953 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:13:22,953 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:13:22,954 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:13:22,954 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:13:22,954 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:13:22,954 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:13:22,955 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:13:22,955 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:13:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states. [2019-01-12 15:13:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:22,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:22,997 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] [2019-01-12 15:13:23,000 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:23,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1090379614, now seen corresponding path program 1 times [2019-01-12 15:13:23,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:23,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:23,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:23,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:23,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:23,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:23,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:23,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:23,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:23,220 INFO L87 Difference]: Start difference. First operand 421 states. Second operand 3 states. [2019-01-12 15:13:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:23,325 INFO L93 Difference]: Finished difference Result 837 states and 1301 transitions. [2019-01-12 15:13:23,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:23,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:23,350 INFO L225 Difference]: With dead ends: 837 [2019-01-12 15:13:23,350 INFO L226 Difference]: Without dead ends: 417 [2019-01-12 15:13:23,356 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 [2019-01-12 15:13:23,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-01-12 15:13:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-01-12 15:13:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-01-12 15:13:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 633 transitions. [2019-01-12 15:13:23,433 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 633 transitions. Word has length 72 [2019-01-12 15:13:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:23,433 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 633 transitions. [2019-01-12 15:13:23,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 633 transitions. [2019-01-12 15:13:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:23,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:23,437 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] [2019-01-12 15:13:23,437 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:23,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash 136439456, now seen corresponding path program 1 times [2019-01-12 15:13:23,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:23,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:23,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:23,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:23,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:23,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:23,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:23,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:23,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:23,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:23,549 INFO L87 Difference]: Start difference. First operand 417 states and 633 transitions. Second operand 3 states. [2019-01-12 15:13:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:23,782 INFO L93 Difference]: Finished difference Result 1143 states and 1731 transitions. [2019-01-12 15:13:23,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:23,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:23,794 INFO L225 Difference]: With dead ends: 1143 [2019-01-12 15:13:23,795 INFO L226 Difference]: Without dead ends: 735 [2019-01-12 15:13:23,799 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 [2019-01-12 15:13:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-01-12 15:13:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 731. [2019-01-12 15:13:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1106 transitions. [2019-01-12 15:13:23,885 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1106 transitions. Word has length 72 [2019-01-12 15:13:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:23,887 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1106 transitions. [2019-01-12 15:13:23,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1106 transitions. [2019-01-12 15:13:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:23,896 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:23,897 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] [2019-01-12 15:13:23,897 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:23,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:23,898 INFO L82 PathProgramCache]: Analyzing trace with hash -51966948, now seen corresponding path program 1 times [2019-01-12 15:13:23,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:23,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:23,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:23,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:23,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:24,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:24,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:24,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:24,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:24,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:24,020 INFO L87 Difference]: Start difference. First operand 731 states and 1106 transitions. Second operand 3 states. [2019-01-12 15:13:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:24,162 INFO L93 Difference]: Finished difference Result 1452 states and 2197 transitions. [2019-01-12 15:13:24,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:24,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:24,168 INFO L225 Difference]: With dead ends: 1452 [2019-01-12 15:13:24,168 INFO L226 Difference]: Without dead ends: 731 [2019-01-12 15:13:24,170 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 [2019-01-12 15:13:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-01-12 15:13:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-01-12 15:13:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1098 transitions. [2019-01-12 15:13:24,211 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1098 transitions. Word has length 72 [2019-01-12 15:13:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:24,212 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1098 transitions. [2019-01-12 15:13:24,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1098 transitions. [2019-01-12 15:13:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:24,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:24,214 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] [2019-01-12 15:13:24,215 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:24,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash -469363554, now seen corresponding path program 1 times [2019-01-12 15:13:24,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:24,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:24,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:24,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:24,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:24,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:24,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:24,294 INFO L87 Difference]: Start difference. First operand 731 states and 1098 transitions. Second operand 3 states. [2019-01-12 15:13:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:24,468 INFO L93 Difference]: Finished difference Result 1451 states and 2180 transitions. [2019-01-12 15:13:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:24,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:24,475 INFO L225 Difference]: With dead ends: 1451 [2019-01-12 15:13:24,476 INFO L226 Difference]: Without dead ends: 731 [2019-01-12 15:13:24,478 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 [2019-01-12 15:13:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-01-12 15:13:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-01-12 15:13:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1090 transitions. [2019-01-12 15:13:24,527 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1090 transitions. Word has length 72 [2019-01-12 15:13:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:24,531 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1090 transitions. [2019-01-12 15:13:24,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1090 transitions. [2019-01-12 15:13:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:24,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:24,533 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] [2019-01-12 15:13:24,533 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:24,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:24,539 INFO L82 PathProgramCache]: Analyzing trace with hash 428763418, now seen corresponding path program 1 times [2019-01-12 15:13:24,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:24,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:24,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:24,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:24,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:24,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:24,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:24,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:24,659 INFO L87 Difference]: Start difference. First operand 731 states and 1090 transitions. Second operand 3 states. [2019-01-12 15:13:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:24,825 INFO L93 Difference]: Finished difference Result 1450 states and 2163 transitions. [2019-01-12 15:13:24,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:24,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:24,831 INFO L225 Difference]: With dead ends: 1450 [2019-01-12 15:13:24,831 INFO L226 Difference]: Without dead ends: 731 [2019-01-12 15:13:24,834 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 [2019-01-12 15:13:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-01-12 15:13:24,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-01-12 15:13:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1082 transitions. [2019-01-12 15:13:24,873 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1082 transitions. Word has length 72 [2019-01-12 15:13:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:24,873 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1082 transitions. [2019-01-12 15:13:24,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1082 transitions. [2019-01-12 15:13:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:24,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:24,876 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] [2019-01-12 15:13:24,877 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1481927394, now seen corresponding path program 1 times [2019-01-12 15:13:24,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:24,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:24,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:24,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:24,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:24,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:24,997 INFO L87 Difference]: Start difference. First operand 731 states and 1082 transitions. Second operand 3 states. [2019-01-12 15:13:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:25,321 INFO L93 Difference]: Finished difference Result 1448 states and 2144 transitions. [2019-01-12 15:13:25,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:25,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:25,330 INFO L225 Difference]: With dead ends: 1448 [2019-01-12 15:13:25,330 INFO L226 Difference]: Without dead ends: 731 [2019-01-12 15:13:25,333 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 [2019-01-12 15:13:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-01-12 15:13:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-01-12 15:13:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1062 transitions. [2019-01-12 15:13:25,390 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1062 transitions. Word has length 72 [2019-01-12 15:13:25,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:25,390 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1062 transitions. [2019-01-12 15:13:25,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:25,390 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1062 transitions. [2019-01-12 15:13:25,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:25,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:25,393 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] [2019-01-12 15:13:25,393 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:25,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1411017443, now seen corresponding path program 1 times [2019-01-12 15:13:25,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:25,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:25,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:25,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:25,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:25,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:25,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:25,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:25,495 INFO L87 Difference]: Start difference. First operand 731 states and 1062 transitions. Second operand 3 states. [2019-01-12 15:13:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:25,940 INFO L93 Difference]: Finished difference Result 1447 states and 2103 transitions. [2019-01-12 15:13:25,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:25,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:25,946 INFO L225 Difference]: With dead ends: 1447 [2019-01-12 15:13:25,946 INFO L226 Difference]: Without dead ends: 731 [2019-01-12 15:13:25,948 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 [2019-01-12 15:13:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-01-12 15:13:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-01-12 15:13:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1042 transitions. [2019-01-12 15:13:25,985 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1042 transitions. Word has length 72 [2019-01-12 15:13:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:25,986 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1042 transitions. [2019-01-12 15:13:25,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1042 transitions. [2019-01-12 15:13:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:25,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:25,988 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] [2019-01-12 15:13:25,989 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:25,989 INFO L82 PathProgramCache]: Analyzing trace with hash -149398177, now seen corresponding path program 1 times [2019-01-12 15:13:25,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:25,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:25,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:25,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:25,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:26,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:26,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:26,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:26,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:26,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:26,075 INFO L87 Difference]: Start difference. First operand 731 states and 1042 transitions. Second operand 3 states. [2019-01-12 15:13:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:26,470 INFO L93 Difference]: Finished difference Result 1446 states and 2062 transitions. [2019-01-12 15:13:26,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:26,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:26,476 INFO L225 Difference]: With dead ends: 1446 [2019-01-12 15:13:26,476 INFO L226 Difference]: Without dead ends: 731 [2019-01-12 15:13:26,478 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 [2019-01-12 15:13:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-01-12 15:13:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-01-12 15:13:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1022 transitions. [2019-01-12 15:13:26,512 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1022 transitions. Word has length 72 [2019-01-12 15:13:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:26,512 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1022 transitions. [2019-01-12 15:13:26,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1022 transitions. [2019-01-12 15:13:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:26,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:26,514 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] [2019-01-12 15:13:26,514 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:26,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:26,514 INFO L82 PathProgramCache]: Analyzing trace with hash -962003548, now seen corresponding path program 1 times [2019-01-12 15:13:26,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:26,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:26,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:26,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:26,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:26,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:26,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:26,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:26,597 INFO L87 Difference]: Start difference. First operand 731 states and 1022 transitions. Second operand 3 states. [2019-01-12 15:13:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:26,993 INFO L93 Difference]: Finished difference Result 1445 states and 2021 transitions. [2019-01-12 15:13:26,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:26,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:27,001 INFO L225 Difference]: With dead ends: 1445 [2019-01-12 15:13:27,002 INFO L226 Difference]: Without dead ends: 731 [2019-01-12 15:13:27,004 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 [2019-01-12 15:13:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-01-12 15:13:27,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-01-12 15:13:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1002 transitions. [2019-01-12 15:13:27,058 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1002 transitions. Word has length 72 [2019-01-12 15:13:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:27,059 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1002 transitions. [2019-01-12 15:13:27,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1002 transitions. [2019-01-12 15:13:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:27,063 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:27,064 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] [2019-01-12 15:13:27,064 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1942397152, now seen corresponding path program 1 times [2019-01-12 15:13:27,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:27,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:27,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:27,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:27,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:27,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:27,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:27,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:27,160 INFO L87 Difference]: Start difference. First operand 731 states and 1002 transitions. Second operand 3 states. [2019-01-12 15:13:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:27,566 INFO L93 Difference]: Finished difference Result 1444 states and 1980 transitions. [2019-01-12 15:13:27,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:27,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:27,572 INFO L225 Difference]: With dead ends: 1444 [2019-01-12 15:13:27,573 INFO L226 Difference]: Without dead ends: 731 [2019-01-12 15:13:27,575 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 [2019-01-12 15:13:27,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-01-12 15:13:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-01-12 15:13:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 982 transitions. [2019-01-12 15:13:27,609 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 982 transitions. Word has length 72 [2019-01-12 15:13:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:27,610 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 982 transitions. [2019-01-12 15:13:27,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 982 transitions. [2019-01-12 15:13:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:27,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:27,612 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] [2019-01-12 15:13:27,612 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1527286429, now seen corresponding path program 1 times [2019-01-12 15:13:27,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:27,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:27,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:27,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:27,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:27,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:27,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:27,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:27,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:27,729 INFO L87 Difference]: Start difference. First operand 731 states and 982 transitions. Second operand 3 states. [2019-01-12 15:13:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:27,890 INFO L93 Difference]: Finished difference Result 1449 states and 1946 transitions. [2019-01-12 15:13:27,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:27,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:27,897 INFO L225 Difference]: With dead ends: 1449 [2019-01-12 15:13:27,898 INFO L226 Difference]: Without dead ends: 731 [2019-01-12 15:13:27,900 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 [2019-01-12 15:13:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-01-12 15:13:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-01-12 15:13:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-01-12 15:13:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 974 transitions. [2019-01-12 15:13:27,938 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 974 transitions. Word has length 72 [2019-01-12 15:13:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:27,941 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 974 transitions. [2019-01-12 15:13:27,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 974 transitions. [2019-01-12 15:13:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:13:27,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:27,942 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] [2019-01-12 15:13:27,943 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:27,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1950032417, now seen corresponding path program 1 times [2019-01-12 15:13:27,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:27,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:27,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:27,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:27,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:28,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:28,040 INFO L87 Difference]: Start difference. First operand 731 states and 974 transitions. Second operand 3 states. [2019-01-12 15:13:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:28,600 INFO L93 Difference]: Finished difference Result 2078 states and 2774 transitions. [2019-01-12 15:13:28,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:28,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:13:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:28,614 INFO L225 Difference]: With dead ends: 2078 [2019-01-12 15:13:28,614 INFO L226 Difference]: Without dead ends: 1367 [2019-01-12 15:13:28,617 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 [2019-01-12 15:13:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-01-12 15:13:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1301. [2019-01-12 15:13:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-01-12 15:13:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1723 transitions. [2019-01-12 15:13:28,707 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1723 transitions. Word has length 72 [2019-01-12 15:13:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:28,707 INFO L480 AbstractCegarLoop]: Abstraction has 1301 states and 1723 transitions. [2019-01-12 15:13:28,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1723 transitions. [2019-01-12 15:13:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:13:28,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:28,712 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] [2019-01-12 15:13:28,712 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1262693056, now seen corresponding path program 1 times [2019-01-12 15:13:28,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:28,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:28,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:28,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:28,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:29,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:29,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:13:29,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:13:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:13:29,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:13:29,017 INFO L87 Difference]: Start difference. First operand 1301 states and 1723 transitions. Second operand 5 states. [2019-01-12 15:13:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:30,146 INFO L93 Difference]: Finished difference Result 2968 states and 3967 transitions. [2019-01-12 15:13:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:13:30,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-01-12 15:13:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:30,160 INFO L225 Difference]: With dead ends: 2968 [2019-01-12 15:13:30,160 INFO L226 Difference]: Without dead ends: 1691 [2019-01-12 15:13:30,164 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 [2019-01-12 15:13:30,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-01-12 15:13:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1307. [2019-01-12 15:13:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2019-01-12 15:13:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1706 transitions. [2019-01-12 15:13:30,266 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1706 transitions. Word has length 117 [2019-01-12 15:13:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:30,267 INFO L480 AbstractCegarLoop]: Abstraction has 1307 states and 1706 transitions. [2019-01-12 15:13:30,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:13:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1706 transitions. [2019-01-12 15:13:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:13:30,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:30,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] [2019-01-12 15:13:30,272 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:30,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1661445820, now seen corresponding path program 1 times [2019-01-12 15:13:30,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:30,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:30,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:30,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:30,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:30,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:30,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:30,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:30,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:30,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:30,426 INFO L87 Difference]: Start difference. First operand 1307 states and 1706 transitions. Second operand 3 states. [2019-01-12 15:13:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:31,100 INFO L93 Difference]: Finished difference Result 3774 states and 4946 transitions. [2019-01-12 15:13:31,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:31,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-01-12 15:13:31,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:31,115 INFO L225 Difference]: With dead ends: 3774 [2019-01-12 15:13:31,115 INFO L226 Difference]: Without dead ends: 2493 [2019-01-12 15:13:31,119 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 [2019-01-12 15:13:31,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-01-12 15:13:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2377. [2019-01-12 15:13:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2019-01-12 15:13:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3100 transitions. [2019-01-12 15:13:31,257 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3100 transitions. Word has length 117 [2019-01-12 15:13:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:31,259 INFO L480 AbstractCegarLoop]: Abstraction has 2377 states and 3100 transitions. [2019-01-12 15:13:31,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3100 transitions. [2019-01-12 15:13:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:13:31,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:31,263 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] [2019-01-12 15:13:31,264 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2061437019, now seen corresponding path program 1 times [2019-01-12 15:13:31,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:31,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:31,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:31,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:31,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:31,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:13:31,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:13:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:13:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:13:31,481 INFO L87 Difference]: Start difference. First operand 2377 states and 3100 transitions. Second operand 5 states. [2019-01-12 15:13:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:32,714 INFO L93 Difference]: Finished difference Result 5178 states and 6787 transitions. [2019-01-12 15:13:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:13:32,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-01-12 15:13:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:32,730 INFO L225 Difference]: With dead ends: 5178 [2019-01-12 15:13:32,730 INFO L226 Difference]: Without dead ends: 2831 [2019-01-12 15:13:32,736 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 [2019-01-12 15:13:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2019-01-12 15:13:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2383. [2019-01-12 15:13:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2383 states. [2019-01-12 15:13:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3063 transitions. [2019-01-12 15:13:32,892 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3063 transitions. Word has length 117 [2019-01-12 15:13:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:32,892 INFO L480 AbstractCegarLoop]: Abstraction has 2383 states and 3063 transitions. [2019-01-12 15:13:32,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:13:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3063 transitions. [2019-01-12 15:13:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:13:32,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:32,897 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] [2019-01-12 15:13:32,898 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash 672376535, now seen corresponding path program 1 times [2019-01-12 15:13:32,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:32,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:32,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:32,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:32,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:33,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:33,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:13:33,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:13:33,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:13:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:13:33,166 INFO L87 Difference]: Start difference. First operand 2383 states and 3063 transitions. Second operand 5 states. [2019-01-12 15:13:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:34,047 INFO L93 Difference]: Finished difference Result 5747 states and 7403 transitions. [2019-01-12 15:13:34,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:13:34,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-01-12 15:13:34,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:34,064 INFO L225 Difference]: With dead ends: 5747 [2019-01-12 15:13:34,064 INFO L226 Difference]: Without dead ends: 3401 [2019-01-12 15:13:34,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:13:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2019-01-12 15:13:34,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2395. [2019-01-12 15:13:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2019-01-12 15:13:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3034 transitions. [2019-01-12 15:13:34,313 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3034 transitions. Word has length 117 [2019-01-12 15:13:34,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:34,313 INFO L480 AbstractCegarLoop]: Abstraction has 2395 states and 3034 transitions. [2019-01-12 15:13:34,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:13:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3034 transitions. [2019-01-12 15:13:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:13:34,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:34,318 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] [2019-01-12 15:13:34,319 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:34,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2033200557, now seen corresponding path program 1 times [2019-01-12 15:13:34,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:34,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:34,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:34,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:34,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:34,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:34,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:13:34,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:13:34,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:13:34,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:13:34,596 INFO L87 Difference]: Start difference. First operand 2395 states and 3034 transitions. Second operand 5 states. [2019-01-12 15:13:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:35,108 INFO L93 Difference]: Finished difference Result 6833 states and 8746 transitions. [2019-01-12 15:13:35,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:13:35,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-01-12 15:13:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:35,125 INFO L225 Difference]: With dead ends: 6833 [2019-01-12 15:13:35,125 INFO L226 Difference]: Without dead ends: 4489 [2019-01-12 15:13:35,131 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 [2019-01-12 15:13:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2019-01-12 15:13:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 2419. [2019-01-12 15:13:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2419 states. [2019-01-12 15:13:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3021 transitions. [2019-01-12 15:13:35,335 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3021 transitions. Word has length 117 [2019-01-12 15:13:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:35,336 INFO L480 AbstractCegarLoop]: Abstraction has 2419 states and 3021 transitions. [2019-01-12 15:13:35,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:13:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3021 transitions. [2019-01-12 15:13:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:13:35,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:35,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] [2019-01-12 15:13:35,341 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:35,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2118887473, now seen corresponding path program 1 times [2019-01-12 15:13:35,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:35,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:35,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:35,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:35,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:35,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:35,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:35,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:35,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:35,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:35,472 INFO L87 Difference]: Start difference. First operand 2419 states and 3021 transitions. Second operand 3 states. [2019-01-12 15:13:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:35,885 INFO L93 Difference]: Finished difference Result 6877 states and 8545 transitions. [2019-01-12 15:13:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:35,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-01-12 15:13:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:35,903 INFO L225 Difference]: With dead ends: 6877 [2019-01-12 15:13:35,903 INFO L226 Difference]: Without dead ends: 4519 [2019-01-12 15:13:35,908 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 [2019-01-12 15:13:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2019-01-12 15:13:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4515. [2019-01-12 15:13:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4515 states. [2019-01-12 15:13:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 5559 transitions. [2019-01-12 15:13:36,185 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 5559 transitions. Word has length 117 [2019-01-12 15:13:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:36,185 INFO L480 AbstractCegarLoop]: Abstraction has 4515 states and 5559 transitions. [2019-01-12 15:13:36,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 5559 transitions. [2019-01-12 15:13:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-12 15:13:36,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:36,189 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] [2019-01-12 15:13:36,189 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:36,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:36,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1555831778, now seen corresponding path program 1 times [2019-01-12 15:13:36,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:36,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:36,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:36,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:36,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:36,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:36,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:36,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:36,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:36,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:36,293 INFO L87 Difference]: Start difference. First operand 4515 states and 5559 transitions. Second operand 3 states. [2019-01-12 15:13:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:36,705 INFO L93 Difference]: Finished difference Result 12790 states and 15720 transitions. [2019-01-12 15:13:36,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:36,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-01-12 15:13:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:36,730 INFO L225 Difference]: With dead ends: 12790 [2019-01-12 15:13:36,731 INFO L226 Difference]: Without dead ends: 8336 [2019-01-12 15:13:36,740 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 [2019-01-12 15:13:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8336 states. [2019-01-12 15:13:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8336 to 8332. [2019-01-12 15:13:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8332 states. [2019-01-12 15:13:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8332 states to 8332 states and 10188 transitions. [2019-01-12 15:13:37,271 INFO L78 Accepts]: Start accepts. Automaton has 8332 states and 10188 transitions. Word has length 118 [2019-01-12 15:13:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:37,272 INFO L480 AbstractCegarLoop]: Abstraction has 8332 states and 10188 transitions. [2019-01-12 15:13:37,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 8332 states and 10188 transitions. [2019-01-12 15:13:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-12 15:13:37,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:37,279 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] [2019-01-12 15:13:37,280 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:37,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1011990556, now seen corresponding path program 1 times [2019-01-12 15:13:37,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:37,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:37,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:37,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:37,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:13:37,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:37,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:37,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:37,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:37,352 INFO L87 Difference]: Start difference. First operand 8332 states and 10188 transitions. Second operand 3 states. [2019-01-12 15:13:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:37,787 INFO L93 Difference]: Finished difference Result 16548 states and 20246 transitions. [2019-01-12 15:13:37,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:37,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-01-12 15:13:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:37,812 INFO L225 Difference]: With dead ends: 16548 [2019-01-12 15:13:37,812 INFO L226 Difference]: Without dead ends: 8277 [2019-01-12 15:13:37,826 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 [2019-01-12 15:13:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2019-01-12 15:13:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 8277. [2019-01-12 15:13:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8277 states. [2019-01-12 15:13:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 10126 transitions. [2019-01-12 15:13:38,441 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 10126 transitions. Word has length 118 [2019-01-12 15:13:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:38,441 INFO L480 AbstractCegarLoop]: Abstraction has 8277 states and 10126 transitions. [2019-01-12 15:13:38,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 10126 transitions. [2019-01-12 15:13:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 15:13:38,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:38,447 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] [2019-01-12 15:13:38,448 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:38,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:38,448 INFO L82 PathProgramCache]: Analyzing trace with hash -453804771, now seen corresponding path program 1 times [2019-01-12 15:13:38,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:38,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:38,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:38,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:38,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:38,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:38,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:38,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:38,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:38,530 INFO L87 Difference]: Start difference. First operand 8277 states and 10126 transitions. Second operand 3 states. [2019-01-12 15:13:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:39,999 INFO L93 Difference]: Finished difference Result 23779 states and 29069 transitions. [2019-01-12 15:13:40,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:40,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-01-12 15:13:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:40,031 INFO L225 Difference]: With dead ends: 23779 [2019-01-12 15:13:40,031 INFO L226 Difference]: Without dead ends: 15563 [2019-01-12 15:13:40,046 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 [2019-01-12 15:13:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2019-01-12 15:13:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15143. [2019-01-12 15:13:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15143 states. [2019-01-12 15:13:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15143 states to 15143 states and 18441 transitions. [2019-01-12 15:13:41,032 INFO L78 Accepts]: Start accepts. Automaton has 15143 states and 18441 transitions. Word has length 119 [2019-01-12 15:13:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:41,032 INFO L480 AbstractCegarLoop]: Abstraction has 15143 states and 18441 transitions. [2019-01-12 15:13:41,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 15143 states and 18441 transitions. [2019-01-12 15:13:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-12 15:13:41,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:41,041 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] [2019-01-12 15:13:41,042 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2112373853, now seen corresponding path program 1 times [2019-01-12 15:13:41,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:41,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:41,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:13:41,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:41,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:41,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:41,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:41,125 INFO L87 Difference]: Start difference. First operand 15143 states and 18441 transitions. Second operand 3 states. [2019-01-12 15:13:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:42,147 INFO L93 Difference]: Finished difference Result 30188 states and 36773 transitions. [2019-01-12 15:13:42,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:42,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-01-12 15:13:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:42,176 INFO L225 Difference]: With dead ends: 30188 [2019-01-12 15:13:42,177 INFO L226 Difference]: Without dead ends: 15089 [2019-01-12 15:13:42,200 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 [2019-01-12 15:13:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15089 states. [2019-01-12 15:13:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15089 to 15089. [2019-01-12 15:13:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15089 states. [2019-01-12 15:13:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15089 states to 15089 states and 18381 transitions. [2019-01-12 15:13:43,146 INFO L78 Accepts]: Start accepts. Automaton has 15089 states and 18381 transitions. Word has length 119 [2019-01-12 15:13:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:43,146 INFO L480 AbstractCegarLoop]: Abstraction has 15089 states and 18381 transitions. [2019-01-12 15:13:43,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 15089 states and 18381 transitions. [2019-01-12 15:13:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 15:13:43,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:43,155 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] [2019-01-12 15:13:43,156 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:43,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:43,156 INFO L82 PathProgramCache]: Analyzing trace with hash 564824724, now seen corresponding path program 1 times [2019-01-12 15:13:43,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:43,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:43,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:43,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:43,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:43,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:43,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:43,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:43,266 INFO L87 Difference]: Start difference. First operand 15089 states and 18381 transitions. Second operand 3 states. [2019-01-12 15:13:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:44,881 INFO L93 Difference]: Finished difference Result 42542 states and 51834 transitions. [2019-01-12 15:13:44,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:44,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-12 15:13:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:44,922 INFO L225 Difference]: With dead ends: 42542 [2019-01-12 15:13:44,922 INFO L226 Difference]: Without dead ends: 27514 [2019-01-12 15:13:44,945 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 [2019-01-12 15:13:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27514 states. [2019-01-12 15:13:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27514 to 27510. [2019-01-12 15:13:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27510 states. [2019-01-12 15:13:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27510 states to 27510 states and 33430 transitions. [2019-01-12 15:13:46,678 INFO L78 Accepts]: Start accepts. Automaton has 27510 states and 33430 transitions. Word has length 120 [2019-01-12 15:13:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:46,679 INFO L480 AbstractCegarLoop]: Abstraction has 27510 states and 33430 transitions. [2019-01-12 15:13:46,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 27510 states and 33430 transitions. [2019-01-12 15:13:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 15:13:46,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:46,688 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] [2019-01-12 15:13:46,688 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2002997610, now seen corresponding path program 1 times [2019-01-12 15:13:46,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:46,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:46,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:46,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:46,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 15:13:46,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:46,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:46,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:46,770 INFO L87 Difference]: Start difference. First operand 27510 states and 33430 transitions. Second operand 3 states. [2019-01-12 15:13:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:48,751 INFO L93 Difference]: Finished difference Result 54906 states and 66736 transitions. [2019-01-12 15:13:48,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:48,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-01-12 15:13:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:48,788 INFO L225 Difference]: With dead ends: 54906 [2019-01-12 15:13:48,789 INFO L226 Difference]: Without dead ends: 27457 [2019-01-12 15:13:48,811 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 [2019-01-12 15:13:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27457 states. [2019-01-12 15:13:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27457 to 27457. [2019-01-12 15:13:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27457 states. [2019-01-12 15:13:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27457 states to 27457 states and 33372 transitions. [2019-01-12 15:13:50,216 INFO L78 Accepts]: Start accepts. Automaton has 27457 states and 33372 transitions. Word has length 120 [2019-01-12 15:13:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:50,216 INFO L480 AbstractCegarLoop]: Abstraction has 27457 states and 33372 transitions. [2019-01-12 15:13:50,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27457 states and 33372 transitions. [2019-01-12 15:13:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 15:13:50,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:50,224 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] [2019-01-12 15:13:50,225 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash 933474923, now seen corresponding path program 1 times [2019-01-12 15:13:50,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:50,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:50,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:50,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:50,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:13:50,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:50,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:50,314 INFO L87 Difference]: Start difference. First operand 27457 states and 33372 transitions. Second operand 3 states. [2019-01-12 15:13:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:13:53,556 INFO L93 Difference]: Finished difference Result 78974 states and 95659 transitions. [2019-01-12 15:13:53,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:13:53,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-01-12 15:13:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:13:53,632 INFO L225 Difference]: With dead ends: 78974 [2019-01-12 15:13:53,633 INFO L226 Difference]: Without dead ends: 39641 [2019-01-12 15:13:53,686 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 [2019-01-12 15:13:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39641 states. [2019-01-12 15:13:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39641 to 39641. [2019-01-12 15:13:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39641 states. [2019-01-12 15:13:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39641 states to 39641 states and 47863 transitions. [2019-01-12 15:13:56,736 INFO L78 Accepts]: Start accepts. Automaton has 39641 states and 47863 transitions. Word has length 121 [2019-01-12 15:13:56,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:13:56,737 INFO L480 AbstractCegarLoop]: Abstraction has 39641 states and 47863 transitions. [2019-01-12 15:13:56,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:13:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 39641 states and 47863 transitions. [2019-01-12 15:13:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-12 15:13:56,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:13:56,754 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] [2019-01-12 15:13:56,755 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:13:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:13:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash 334867575, now seen corresponding path program 1 times [2019-01-12 15:13:56,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:13:56,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:13:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:13:56,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:13:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:13:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:13:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:13:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:13:56,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:13:56,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:13:56,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:13:56,862 INFO L87 Difference]: Start difference. First operand 39641 states and 47863 transitions. Second operand 3 states. [2019-01-12 15:14:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:00,039 INFO L93 Difference]: Finished difference Result 91203 states and 109883 transitions. [2019-01-12 15:14:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:00,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-01-12 15:14:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:00,091 INFO L225 Difference]: With dead ends: 91203 [2019-01-12 15:14:00,091 INFO L226 Difference]: Without dead ends: 51608 [2019-01-12 15:14:00,122 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 [2019-01-12 15:14:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51608 states. [2019-01-12 15:14:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51608 to 51416. [2019-01-12 15:14:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51416 states. [2019-01-12 15:14:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51416 states to 51416 states and 61605 transitions. [2019-01-12 15:14:02,867 INFO L78 Accepts]: Start accepts. Automaton has 51416 states and 61605 transitions. Word has length 156 [2019-01-12 15:14:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:02,868 INFO L480 AbstractCegarLoop]: Abstraction has 51416 states and 61605 transitions. [2019-01-12 15:14:02,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 51416 states and 61605 transitions. [2019-01-12 15:14:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-12 15:14:02,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:02,907 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] [2019-01-12 15:14:02,908 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:02,908 INFO L82 PathProgramCache]: Analyzing trace with hash -67611790, now seen corresponding path program 1 times [2019-01-12 15:14:02,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:02,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:02,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:02,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:02,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 15:14:03,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:03,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:03,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:03,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:03,031 INFO L87 Difference]: Start difference. First operand 51416 states and 61605 transitions. Second operand 3 states. [2019-01-12 15:14:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:06,668 INFO L93 Difference]: Finished difference Result 101872 states and 121803 transitions. [2019-01-12 15:14:06,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:06,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-01-12 15:14:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:06,741 INFO L225 Difference]: With dead ends: 101872 [2019-01-12 15:14:06,741 INFO L226 Difference]: Without dead ends: 50516 [2019-01-12 15:14:06,784 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 [2019-01-12 15:14:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50516 states. [2019-01-12 15:14:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50516 to 50516. [2019-01-12 15:14:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50516 states. [2019-01-12 15:14:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50516 states to 50516 states and 59621 transitions. [2019-01-12 15:14:09,941 INFO L78 Accepts]: Start accepts. Automaton has 50516 states and 59621 transitions. Word has length 174 [2019-01-12 15:14:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:09,942 INFO L480 AbstractCegarLoop]: Abstraction has 50516 states and 59621 transitions. [2019-01-12 15:14:09,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 50516 states and 59621 transitions. [2019-01-12 15:14:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-12 15:14:09,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:09,964 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] [2019-01-12 15:14:09,965 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1145557634, now seen corresponding path program 1 times [2019-01-12 15:14:09,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:09,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:09,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:09,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:09,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:14:10,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:10,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:10,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:10,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:10,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:10,057 INFO L87 Difference]: Start difference. First operand 50516 states and 59621 transitions. Second operand 3 states. [2019-01-12 15:14:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:12,893 INFO L93 Difference]: Finished difference Result 89380 states and 105829 transitions. [2019-01-12 15:14:12,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:12,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-01-12 15:14:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:12,978 INFO L225 Difference]: With dead ends: 89380 [2019-01-12 15:14:12,978 INFO L226 Difference]: Without dead ends: 50520 [2019-01-12 15:14:13,021 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 [2019-01-12 15:14:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50520 states. [2019-01-12 15:14:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50520 to 50516. [2019-01-12 15:14:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50516 states. [2019-01-12 15:14:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50516 states to 50516 states and 59513 transitions. [2019-01-12 15:14:18,175 INFO L78 Accepts]: Start accepts. Automaton has 50516 states and 59513 transitions. Word has length 175 [2019-01-12 15:14:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:18,175 INFO L480 AbstractCegarLoop]: Abstraction has 50516 states and 59513 transitions. [2019-01-12 15:14:18,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 50516 states and 59513 transitions. [2019-01-12 15:14:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-12 15:14:18,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:18,199 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] [2019-01-12 15:14:18,199 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2011308056, now seen corresponding path program 1 times [2019-01-12 15:14:18,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:18,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:18,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:18,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:18,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-12 15:14:18,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:18,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:14:18,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:18,308 INFO L87 Difference]: Start difference. First operand 50516 states and 59513 transitions. Second operand 3 states. [2019-01-12 15:14:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:22,003 INFO L93 Difference]: Finished difference Result 111624 states and 131256 transitions. [2019-01-12 15:14:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:22,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-01-12 15:14:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:22,079 INFO L225 Difference]: With dead ends: 111624 [2019-01-12 15:14:22,079 INFO L226 Difference]: Without dead ends: 61147 [2019-01-12 15:14:22,115 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 [2019-01-12 15:14:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61147 states. [2019-01-12 15:14:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61147 to 60891. [2019-01-12 15:14:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60891 states. [2019-01-12 15:14:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 71287 transitions. [2019-01-12 15:14:25,253 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 71287 transitions. Word has length 210 [2019-01-12 15:14:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:25,253 INFO L480 AbstractCegarLoop]: Abstraction has 60891 states and 71287 transitions. [2019-01-12 15:14:25,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 71287 transitions. [2019-01-12 15:14:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-01-12 15:14:25,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:25,296 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] [2019-01-12 15:14:25,296 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1782699020, now seen corresponding path program 1 times [2019-01-12 15:14:25,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:25,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:25,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:25,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:25,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:14:25,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:25,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:25,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:25,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:25,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:25,405 INFO L87 Difference]: Start difference. First operand 60891 states and 71287 transitions. Second operand 3 states. [2019-01-12 15:14:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:29,182 INFO L93 Difference]: Finished difference Result 111351 states and 130739 transitions. [2019-01-12 15:14:29,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:29,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-01-12 15:14:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:29,267 INFO L225 Difference]: With dead ends: 111351 [2019-01-12 15:14:29,267 INFO L226 Difference]: Without dead ends: 60895 [2019-01-12 15:14:29,316 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 [2019-01-12 15:14:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60895 states. [2019-01-12 15:14:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60895 to 60891. [2019-01-12 15:14:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60891 states. [2019-01-12 15:14:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 71123 transitions. [2019-01-12 15:14:33,039 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 71123 transitions. Word has length 213 [2019-01-12 15:14:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:33,040 INFO L480 AbstractCegarLoop]: Abstraction has 60891 states and 71123 transitions. [2019-01-12 15:14:33,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 71123 transitions. [2019-01-12 15:14:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-01-12 15:14:33,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:33,072 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] [2019-01-12 15:14:33,073 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:33,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:33,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1923880001, now seen corresponding path program 1 times [2019-01-12 15:14:33,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:33,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:33,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:33,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:14:33,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:33,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:14:33,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:33,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:33,173 INFO L87 Difference]: Start difference. First operand 60891 states and 71123 transitions. Second operand 3 states. [2019-01-12 15:14:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:37,222 INFO L93 Difference]: Finished difference Result 111475 states and 130537 transitions. [2019-01-12 15:14:37,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:37,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-01-12 15:14:37,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:37,303 INFO L225 Difference]: With dead ends: 111475 [2019-01-12 15:14:37,303 INFO L226 Difference]: Without dead ends: 61019 [2019-01-12 15:14:37,342 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 [2019-01-12 15:14:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61019 states. [2019-01-12 15:14:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61019 to 60891. [2019-01-12 15:14:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60891 states. [2019-01-12 15:14:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 69971 transitions. [2019-01-12 15:14:40,580 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 69971 transitions. Word has length 213 [2019-01-12 15:14:40,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:40,580 INFO L480 AbstractCegarLoop]: Abstraction has 60891 states and 69971 transitions. [2019-01-12 15:14:40,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:14:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 69971 transitions. [2019-01-12 15:14:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-12 15:14:40,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:40,614 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] [2019-01-12 15:14:40,614 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:40,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1073074581, now seen corresponding path program 1 times [2019-01-12 15:14:40,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:40,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:40,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:40,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:40,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:14:40,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:40,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:14:40,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:14:40,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:14:40,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:14:40,731 INFO L87 Difference]: Start difference. First operand 60891 states and 69971 transitions. Second operand 5 states. [2019-01-12 15:14:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:47,433 INFO L93 Difference]: Finished difference Result 154915 states and 179281 transitions. [2019-01-12 15:14:47,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:14:47,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-01-12 15:14:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:47,556 INFO L225 Difference]: With dead ends: 154915 [2019-01-12 15:14:47,556 INFO L226 Difference]: Without dead ends: 94067 [2019-01-12 15:14:47,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:14:47,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94067 states. [2019-01-12 15:14:51,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94067 to 61275. [2019-01-12 15:14:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61275 states. [2019-01-12 15:14:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61275 states to 61275 states and 69410 transitions. [2019-01-12 15:14:51,412 INFO L78 Accepts]: Start accepts. Automaton has 61275 states and 69410 transitions. Word has length 216 [2019-01-12 15:14:51,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:14:51,413 INFO L480 AbstractCegarLoop]: Abstraction has 61275 states and 69410 transitions. [2019-01-12 15:14:51,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:14:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 61275 states and 69410 transitions. [2019-01-12 15:14:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-12 15:14:51,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:14:51,450 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] [2019-01-12 15:14:51,450 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:14:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:14:51,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1497272560, now seen corresponding path program 1 times [2019-01-12 15:14:51,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:14:51,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:14:51,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:51,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:14:51,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:14:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:14:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 15:14:51,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:14:51,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 15:14:51,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:14:51,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:14:51,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:14:51,590 INFO L87 Difference]: Start difference. First operand 61275 states and 69410 transitions. Second operand 3 states. [2019-01-12 15:14:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:14:56,484 INFO L93 Difference]: Finished difference Result 131965 states and 149290 transitions. [2019-01-12 15:14:56,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:14:56,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-01-12 15:14:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:14:56,588 INFO L225 Difference]: With dead ends: 131965 [2019-01-12 15:14:56,588 INFO L226 Difference]: Without dead ends: 70722 [2019-01-12 15:14:56,650 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 [2019-01-12 15:14:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70722 states. [2019-01-12 15:15:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70722 to 70402. [2019-01-12 15:15:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70402 states. [2019-01-12 15:15:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70402 states to 70402 states and 79384 transitions. [2019-01-12 15:15:01,340 INFO L78 Accepts]: Start accepts. Automaton has 70402 states and 79384 transitions. Word has length 250 [2019-01-12 15:15:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:15:01,341 INFO L480 AbstractCegarLoop]: Abstraction has 70402 states and 79384 transitions. [2019-01-12 15:15:01,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:15:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 70402 states and 79384 transitions. [2019-01-12 15:15:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-12 15:15:01,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:15:01,374 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] [2019-01-12 15:15:01,374 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:15:01,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:15:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1211305274, now seen corresponding path program 1 times [2019-01-12 15:15:01,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:15:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:15:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:01,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:15:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:15:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:15:01,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:15:01,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:15:01,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:15:01,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:15:01,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:15:01,472 INFO L87 Difference]: Start difference. First operand 70402 states and 79384 transitions. Second operand 3 states. [2019-01-12 15:15:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:15:07,262 INFO L93 Difference]: Finished difference Result 131622 states and 148736 transitions. [2019-01-12 15:15:07,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:15:07,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-01-12 15:15:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:15:07,371 INFO L225 Difference]: With dead ends: 131622 [2019-01-12 15:15:07,371 INFO L226 Difference]: Without dead ends: 70406 [2019-01-12 15:15:07,431 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 [2019-01-12 15:15:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70406 states. [2019-01-12 15:15:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70406 to 70402. [2019-01-12 15:15:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70402 states. [2019-01-12 15:15:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70402 states to 70402 states and 79128 transitions. [2019-01-12 15:15:12,014 INFO L78 Accepts]: Start accepts. Automaton has 70402 states and 79128 transitions. Word has length 253 [2019-01-12 15:15:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:15:12,015 INFO L480 AbstractCegarLoop]: Abstraction has 70402 states and 79128 transitions. [2019-01-12 15:15:12,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:15:12,015 INFO L276 IsEmpty]: Start isEmpty. Operand 70402 states and 79128 transitions. [2019-01-12 15:15:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-01-12 15:15:12,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:15:12,056 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] [2019-01-12 15:15:12,057 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:15:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:15:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash 78021096, now seen corresponding path program 1 times [2019-01-12 15:15:12,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:15:12,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:15:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:12,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:15:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:15:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 15:15:12,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:15:12,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:15:12,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:15:12,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:15:12,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:15:12,131 INFO L87 Difference]: Start difference. First operand 70402 states and 79128 transitions. Second operand 3 states. [2019-01-12 15:15:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:15:14,365 INFO L93 Difference]: Finished difference Result 91476 states and 102378 transitions. [2019-01-12 15:15:14,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:15:14,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-01-12 15:15:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:15:14,380 INFO L225 Difference]: With dead ends: 91476 [2019-01-12 15:15:14,380 INFO L226 Difference]: Without dead ends: 10928 [2019-01-12 15:15:14,432 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 [2019-01-12 15:15:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10928 states. [2019-01-12 15:15:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10928 to 10920. [2019-01-12 15:15:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-01-12 15:15:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 11793 transitions. [2019-01-12 15:15:15,059 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 11793 transitions. Word has length 292 [2019-01-12 15:15:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:15:15,059 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 11793 transitions. [2019-01-12 15:15:15,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:15:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 11793 transitions. [2019-01-12 15:15:15,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-01-12 15:15:15,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:15:15,070 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] [2019-01-12 15:15:15,070 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:15:15,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:15:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash -394404878, now seen corresponding path program 1 times [2019-01-12 15:15:15,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:15:15,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:15:15,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:15,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:15:15,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:15:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:15:15,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:15:15,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:15:15,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:15:15,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:15:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:15:15,196 INFO L87 Difference]: Start difference. First operand 10920 states and 11793 transitions. Second operand 3 states. [2019-01-12 15:15:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:15:16,029 INFO L93 Difference]: Finished difference Result 18698 states and 20230 transitions. [2019-01-12 15:15:16,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:15:16,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-01-12 15:15:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:15:16,043 INFO L225 Difference]: With dead ends: 18698 [2019-01-12 15:15:16,043 INFO L226 Difference]: Without dead ends: 10920 [2019-01-12 15:15:16,052 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 [2019-01-12 15:15:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2019-01-12 15:15:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 10920. [2019-01-12 15:15:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-01-12 15:15:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 11685 transitions. [2019-01-12 15:15:16,682 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 11685 transitions. Word has length 293 [2019-01-12 15:15:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:15:16,683 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 11685 transitions. [2019-01-12 15:15:16,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:15:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 11685 transitions. [2019-01-12 15:15:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-01-12 15:15:16,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:15:16,693 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] [2019-01-12 15:15:16,693 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:15:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:15:16,694 INFO L82 PathProgramCache]: Analyzing trace with hash 526279388, now seen corresponding path program 1 times [2019-01-12 15:15:16,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:15:16,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:15:16,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:16,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:15:16,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:15:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:15:16,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:15:16,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:15:16,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:15:16,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:15:16,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:15:16,820 INFO L87 Difference]: Start difference. First operand 10920 states and 11685 transitions. Second operand 3 states. [2019-01-12 15:15:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:15:17,579 INFO L93 Difference]: Finished difference Result 16951 states and 18170 transitions. [2019-01-12 15:15:17,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:15:17,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-01-12 15:15:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:15:17,593 INFO L225 Difference]: With dead ends: 16951 [2019-01-12 15:15:17,593 INFO L226 Difference]: Without dead ends: 10920 [2019-01-12 15:15:17,602 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 [2019-01-12 15:15:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2019-01-12 15:15:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 10920. [2019-01-12 15:15:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-01-12 15:15:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 11599 transitions. [2019-01-12 15:15:18,259 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 11599 transitions. Word has length 297 [2019-01-12 15:15:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:15:18,260 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 11599 transitions. [2019-01-12 15:15:18,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:15:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 11599 transitions. [2019-01-12 15:15:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-12 15:15:18,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:15:18,276 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] [2019-01-12 15:15:18,276 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:15:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:15:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1535852850, now seen corresponding path program 1 times [2019-01-12 15:15:18,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:15:18,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:15:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:18,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:15:18,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:15:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:15:18,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:15:18,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:15:18,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:15:18,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:15:18,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:15:18,689 INFO L87 Difference]: Start difference. First operand 10920 states and 11599 transitions. Second operand 3 states. [2019-01-12 15:15:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:15:19,493 INFO L93 Difference]: Finished difference Result 17684 states and 18802 transitions. [2019-01-12 15:15:19,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:15:19,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-01-12 15:15:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:15:19,510 INFO L225 Difference]: With dead ends: 17684 [2019-01-12 15:15:19,510 INFO L226 Difference]: Without dead ends: 10984 [2019-01-12 15:15:19,520 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 [2019-01-12 15:15:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10984 states. [2019-01-12 15:15:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10984 to 10920. [2019-01-12 15:15:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-01-12 15:15:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 11501 transitions. [2019-01-12 15:15:20,186 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 11501 transitions. Word has length 301 [2019-01-12 15:15:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:15:20,186 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 11501 transitions. [2019-01-12 15:15:20,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:15:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 11501 transitions. [2019-01-12 15:15:20,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-01-12 15:15:20,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:15:20,197 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] [2019-01-12 15:15:20,197 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:15:20,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:15:20,198 INFO L82 PathProgramCache]: Analyzing trace with hash 185562899, now seen corresponding path program 1 times [2019-01-12 15:15:20,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:15:20,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:15:20,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:20,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:15:20,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:15:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:15:20,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:15:20,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:15:20,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:15:20,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:15:20,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:15:20,343 INFO L87 Difference]: Start difference. First operand 10920 states and 11501 transitions. Second operand 3 states. [2019-01-12 15:15:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:15:21,108 INFO L93 Difference]: Finished difference Result 13691 states and 14419 transitions. [2019-01-12 15:15:21,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:15:21,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-01-12 15:15:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:15:21,120 INFO L225 Difference]: With dead ends: 13691 [2019-01-12 15:15:21,120 INFO L226 Difference]: Without dead ends: 8725 [2019-01-12 15:15:21,126 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 [2019-01-12 15:15:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8725 states. [2019-01-12 15:15:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8725 to 8725. [2019-01-12 15:15:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8725 states. [2019-01-12 15:15:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8725 states to 8725 states and 9171 transitions. [2019-01-12 15:15:21,653 INFO L78 Accepts]: Start accepts. Automaton has 8725 states and 9171 transitions. Word has length 304 [2019-01-12 15:15:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:15:21,653 INFO L480 AbstractCegarLoop]: Abstraction has 8725 states and 9171 transitions. [2019-01-12 15:15:21,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:15:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 8725 states and 9171 transitions. [2019-01-12 15:15:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-01-12 15:15:21,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:15:21,663 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] [2019-01-12 15:15:21,663 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:15:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:15:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1149032847, now seen corresponding path program 1 times [2019-01-12 15:15:21,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:15:21,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:15:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:21,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:15:21,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:15:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 15:15:22,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:15:22,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 15:15:22,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:15:22,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:15:22,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:15:22,041 INFO L87 Difference]: Start difference. First operand 8725 states and 9171 transitions. Second operand 7 states. [2019-01-12 15:15:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:15:22,736 INFO L93 Difference]: Finished difference Result 8725 states and 9171 transitions. [2019-01-12 15:15:22,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:15:22,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 308 [2019-01-12 15:15:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:15:22,748 INFO L225 Difference]: With dead ends: 8725 [2019-01-12 15:15:22,748 INFO L226 Difference]: Without dead ends: 8723 [2019-01-12 15:15:22,751 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 [2019-01-12 15:15:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2019-01-12 15:15:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 8723. [2019-01-12 15:15:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8723 states. [2019-01-12 15:15:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8723 states to 8723 states and 9168 transitions. [2019-01-12 15:15:23,322 INFO L78 Accepts]: Start accepts. Automaton has 8723 states and 9168 transitions. Word has length 308 [2019-01-12 15:15:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:15:23,322 INFO L480 AbstractCegarLoop]: Abstraction has 8723 states and 9168 transitions. [2019-01-12 15:15:23,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:15:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8723 states and 9168 transitions. [2019-01-12 15:15:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-01-12 15:15:23,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:15:23,332 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] [2019-01-12 15:15:23,333 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:15:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:15:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1404905635, now seen corresponding path program 1 times [2019-01-12 15:15:23,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:15:23,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:15:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:15:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:15:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-12 15:15:23,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:15:23,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:15:23,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:15:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:15:23,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:15:23,464 INFO L87 Difference]: Start difference. First operand 8723 states and 9168 transitions. Second operand 3 states. [2019-01-12 15:15:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:15:24,231 INFO L93 Difference]: Finished difference Result 11851 states and 12417 transitions. [2019-01-12 15:15:24,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:15:24,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-01-12 15:15:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:15:24,244 INFO L225 Difference]: With dead ends: 11851 [2019-01-12 15:15:24,244 INFO L226 Difference]: Without dead ends: 10279 [2019-01-12 15:15:24,249 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 [2019-01-12 15:15:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10279 states. [2019-01-12 15:15:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10279 to 8725. [2019-01-12 15:15:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8725 states. [2019-01-12 15:15:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8725 states to 8725 states and 9170 transitions. [2019-01-12 15:15:24,850 INFO L78 Accepts]: Start accepts. Automaton has 8725 states and 9170 transitions. Word has length 312 [2019-01-12 15:15:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:15:24,850 INFO L480 AbstractCegarLoop]: Abstraction has 8725 states and 9170 transitions. [2019-01-12 15:15:24,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:15:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 8725 states and 9170 transitions. [2019-01-12 15:15:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-12 15:15:24,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:15:24,860 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] [2019-01-12 15:15:24,860 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:15:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:15:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash -839838432, now seen corresponding path program 1 times [2019-01-12 15:15:24,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:15:24,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:15:24,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:24,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:15:24,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:15:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:15:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:15:25,089 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 15:15:25,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:15:25 BoogieIcfgContainer [2019-01-12 15:15:25,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:15:25,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:15:25,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:15:25,401 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:15:25,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:13:22" (3/4) ... [2019-01-12 15:15:25,412 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 15:15:25,747 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:15:25,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:15:25,751 INFO L168 Benchmark]: Toolchain (without parser) took 126292.14 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 951.3 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-01-12 15:15:25,753 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:15:25,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:15:25,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 178.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:15:25,755 INFO L168 Benchmark]: Boogie Preprocessor took 71.95 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:15:25,755 INFO L168 Benchmark]: RCFGBuilder took 2681.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 974.0 MB in the end (delta: 94.8 MB). Peak memory consumption was 94.8 MB. Max. memory is 11.5 GB. [2019-01-12 15:15:25,756 INFO L168 Benchmark]: TraceAbstraction took 122534.55 ms. Allocated memory was 1.1 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 974.0 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-12 15:15:25,760 INFO L168 Benchmark]: Witness Printer took 347.90 ms. Allocated memory is still 5.5 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. [2019-01-12 15:15:25,764 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 470.47 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 178.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.95 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2681.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 974.0 MB in the end (delta: 94.8 MB). Peak memory consumption was 94.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 122534.55 ms. Allocated memory was 1.1 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 974.0 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 347.90 ms. Allocated memory is still 5.5 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 77.2 MB). Peak memory consumption was 77.2 MB. 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, 122.4s OverallTime, 42 OverallIterations, 3 TraceHistogramMax, 66.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25645 SDtfs, 22698 SDslu, 18605 SDs, 0 SdLazy, 805 SolverSat, 374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s 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: 49.4s AutomataMinimizationTime, 41 MinimizatonAttempts, 39852 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s 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...