./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.04.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.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 ../sv-benchmarks/c/systemc/transmitter.04.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3723db60962369c4b10118802934116c8cea6114 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-9a8b2e8 [2020-10-20 01:53:16,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:53:16,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:53:16,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:53:16,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:53:16,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:53:16,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:53:16,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:53:16,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:53:16,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:53:16,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:53:16,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:53:16,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:53:16,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:53:16,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:53:16,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:53:16,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:53:16,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:53:16,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:53:16,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:53:16,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:53:16,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:53:16,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:53:16,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:53:16,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:53:16,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:53:16,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:53:16,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:53:16,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:53:16,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:53:16,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:53:16,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:53:16,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:53:16,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:53:16,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:53:16,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:53:16,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:53:16,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:53:16,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:53:16,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:53:16,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:53:16,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:53:16,526 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:53:16,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:53:16,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:53:16,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:53:16,531 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:53:16,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:53:16,532 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:53:16,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:53:16,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:53:16,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:53:16,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:53:16,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:53:16,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:53:16,535 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:53:16,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:53:16,536 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:53:16,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:53:16,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:53:16,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:53:16,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:53:16,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:53:16,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:53:16,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:53:16,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:53:16,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:53:16,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:53:16,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:53:16,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:53:16,539 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:53:16,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3723db60962369c4b10118802934116c8cea6114 [2020-10-20 01:53:16,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:53:16,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:53:16,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:53:16,765 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:53:16,766 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:53:16,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.04.cil.c [2020-10-20 01:53:16,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac06b1966/8d8aa6d611d14691ac3434eed688eb65/FLAG2fab65b06 [2020-10-20 01:53:17,330 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:53:17,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.04.cil.c [2020-10-20 01:53:17,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac06b1966/8d8aa6d611d14691ac3434eed688eb65/FLAG2fab65b06 [2020-10-20 01:53:17,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac06b1966/8d8aa6d611d14691ac3434eed688eb65 [2020-10-20 01:53:17,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:53:17,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:53:17,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:17,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:53:17,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:53:17,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:17" (1/1) ... [2020-10-20 01:53:17,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68986b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:17, skipping insertion in model container [2020-10-20 01:53:17,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:17" (1/1) ... [2020-10-20 01:53:17,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:53:17,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:53:18,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:18,217 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:53:18,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:18,298 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:53:18,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18 WrapperNode [2020-10-20 01:53:18,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:18,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:18,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:53:18,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:53:18,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (1/1) ... [2020-10-20 01:53:18,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (1/1) ... [2020-10-20 01:53:18,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:18,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:53:18,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:53:18,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:53:18,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (1/1) ... [2020-10-20 01:53:18,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (1/1) ... [2020-10-20 01:53:18,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (1/1) ... [2020-10-20 01:53:18,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (1/1) ... [2020-10-20 01:53:18,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (1/1) ... [2020-10-20 01:53:18,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (1/1) ... [2020-10-20 01:53:18,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (1/1) ... [2020-10-20 01:53:18,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:53:18,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:53:18,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:53:18,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:53:18,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (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 [2020-10-20 01:53:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:53:18,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:53:18,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:53:18,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:53:19,609 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:53:19,609 INFO L298 CfgBuilder]: Removed 150 assume(true) statements. [2020-10-20 01:53:19,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:19 BoogieIcfgContainer [2020-10-20 01:53:19,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:53:19,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:53:19,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:53:19,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:53:19,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:53:17" (1/3) ... [2020-10-20 01:53:19,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e52c4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:53:19, skipping insertion in model container [2020-10-20 01:53:19,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:18" (2/3) ... [2020-10-20 01:53:19,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e52c4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:53:19, skipping insertion in model container [2020-10-20 01:53:19,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:19" (3/3) ... [2020-10-20 01:53:19,620 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2020-10-20 01:53:19,632 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:53:19,641 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:53:19,655 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:53:19,683 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:53:19,683 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:53:19,683 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:53:19,683 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:53:19,684 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:53:19,684 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:53:19,684 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:53:19,684 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:53:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states. [2020-10-20 01:53:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:19,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:19,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:19,721 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1653942868, now seen corresponding path program 1 times [2020-10-20 01:53:19,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:19,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944467729] [2020-10-20 01:53:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:19,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944467729] [2020-10-20 01:53:19,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:19,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:19,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461700915] [2020-10-20 01:53:19,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:19,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:19,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:19,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:19,976 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 3 states. [2020-10-20 01:53:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:20,060 INFO L93 Difference]: Finished difference Result 744 states and 1160 transitions. [2020-10-20 01:53:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:20,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:20,079 INFO L225 Difference]: With dead ends: 744 [2020-10-20 01:53:20,080 INFO L226 Difference]: Without dead ends: 370 [2020-10-20 01:53:20,088 INFO L677 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 [2020-10-20 01:53:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-10-20 01:53:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2020-10-20 01:53:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-10-20 01:53:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 561 transitions. [2020-10-20 01:53:20,183 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 561 transitions. Word has length 73 [2020-10-20 01:53:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:20,183 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 561 transitions. [2020-10-20 01:53:20,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 561 transitions. [2020-10-20 01:53:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:20,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:20,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:20,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:53:20,187 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1161316694, now seen corresponding path program 1 times [2020-10-20 01:53:20,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:20,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989156857] [2020-10-20 01:53:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:20,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989156857] [2020-10-20 01:53:20,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:20,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:20,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825138024] [2020-10-20 01:53:20,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:20,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:20,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:20,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:20,285 INFO L87 Difference]: Start difference. First operand 370 states and 561 transitions. Second operand 3 states. [2020-10-20 01:53:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:20,398 INFO L93 Difference]: Finished difference Result 1004 states and 1519 transitions. [2020-10-20 01:53:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:20,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:20,404 INFO L225 Difference]: With dead ends: 1004 [2020-10-20 01:53:20,405 INFO L226 Difference]: Without dead ends: 643 [2020-10-20 01:53:20,407 INFO L677 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 [2020-10-20 01:53:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2020-10-20 01:53:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 641. [2020-10-20 01:53:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-20 01:53:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 961 transitions. [2020-10-20 01:53:20,475 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 961 transitions. Word has length 73 [2020-10-20 01:53:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:20,476 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 961 transitions. [2020-10-20 01:53:20,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 961 transitions. [2020-10-20 01:53:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:20,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:20,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:20,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:53:20,480 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:20,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1509510378, now seen corresponding path program 1 times [2020-10-20 01:53:20,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:20,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344422538] [2020-10-20 01:53:20,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:20,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344422538] [2020-10-20 01:53:20,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:20,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:20,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755012281] [2020-10-20 01:53:20,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:20,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:20,538 INFO L87 Difference]: Start difference. First operand 641 states and 961 transitions. Second operand 3 states. [2020-10-20 01:53:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:20,596 INFO L93 Difference]: Finished difference Result 1272 states and 1907 transitions. [2020-10-20 01:53:20,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:20,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:20,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:20,600 INFO L225 Difference]: With dead ends: 1272 [2020-10-20 01:53:20,600 INFO L226 Difference]: Without dead ends: 641 [2020-10-20 01:53:20,602 INFO L677 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 [2020-10-20 01:53:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-10-20 01:53:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2020-10-20 01:53:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-20 01:53:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2020-10-20 01:53:20,636 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 73 [2020-10-20 01:53:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:20,637 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2020-10-20 01:53:20,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2020-10-20 01:53:20,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:20,639 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:20,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:20,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:53:20,639 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:20,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1595666090, now seen corresponding path program 1 times [2020-10-20 01:53:20,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:20,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663846910] [2020-10-20 01:53:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:20,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663846910] [2020-10-20 01:53:20,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:20,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:20,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695789567] [2020-10-20 01:53:20,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:20,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:20,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:20,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:20,694 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2020-10-20 01:53:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:20,843 INFO L93 Difference]: Finished difference Result 1271 states and 1890 transitions. [2020-10-20 01:53:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:20,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:20,848 INFO L225 Difference]: With dead ends: 1271 [2020-10-20 01:53:20,848 INFO L226 Difference]: Without dead ends: 641 [2020-10-20 01:53:20,849 INFO L677 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 [2020-10-20 01:53:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-10-20 01:53:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2020-10-20 01:53:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-20 01:53:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 945 transitions. [2020-10-20 01:53:20,876 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 945 transitions. Word has length 73 [2020-10-20 01:53:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:20,877 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 945 transitions. [2020-10-20 01:53:20,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 945 transitions. [2020-10-20 01:53:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:20,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:20,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:20,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:53:20,879 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:20,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1178269484, now seen corresponding path program 1 times [2020-10-20 01:53:20,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:20,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726006203] [2020-10-20 01:53:20,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:20,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726006203] [2020-10-20 01:53:20,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:20,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:20,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564471754] [2020-10-20 01:53:20,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:20,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:20,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:20,935 INFO L87 Difference]: Start difference. First operand 641 states and 945 transitions. Second operand 3 states. [2020-10-20 01:53:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:20,988 INFO L93 Difference]: Finished difference Result 1270 states and 1873 transitions. [2020-10-20 01:53:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:20,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:20,992 INFO L225 Difference]: With dead ends: 1270 [2020-10-20 01:53:20,993 INFO L226 Difference]: Without dead ends: 641 [2020-10-20 01:53:20,994 INFO L677 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 [2020-10-20 01:53:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-10-20 01:53:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2020-10-20 01:53:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-20 01:53:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 937 transitions. [2020-10-20 01:53:21,023 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 937 transitions. Word has length 73 [2020-10-20 01:53:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:21,023 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 937 transitions. [2020-10-20 01:53:21,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 937 transitions. [2020-10-20 01:53:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:21,025 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:21,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:21,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:53:21,026 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash 52103404, now seen corresponding path program 1 times [2020-10-20 01:53:21,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:21,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349857858] [2020-10-20 01:53:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:21,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349857858] [2020-10-20 01:53:21,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:21,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:21,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109384644] [2020-10-20 01:53:21,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:21,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:21,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:21,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:21,118 INFO L87 Difference]: Start difference. First operand 641 states and 937 transitions. Second operand 3 states. [2020-10-20 01:53:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:21,192 INFO L93 Difference]: Finished difference Result 1268 states and 1854 transitions. [2020-10-20 01:53:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:21,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:21,196 INFO L225 Difference]: With dead ends: 1268 [2020-10-20 01:53:21,196 INFO L226 Difference]: Without dead ends: 641 [2020-10-20 01:53:21,197 INFO L677 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 [2020-10-20 01:53:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-10-20 01:53:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2020-10-20 01:53:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-20 01:53:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 919 transitions. [2020-10-20 01:53:21,224 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 919 transitions. Word has length 73 [2020-10-20 01:53:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:21,225 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 919 transitions. [2020-10-20 01:53:21,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 919 transitions. [2020-10-20 01:53:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:21,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:21,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:21,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:53:21,230 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2144832493, now seen corresponding path program 1 times [2020-10-20 01:53:21,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:21,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878133690] [2020-10-20 01:53:21,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:21,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878133690] [2020-10-20 01:53:21,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:21,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:21,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030212484] [2020-10-20 01:53:21,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:21,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:21,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:21,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:21,329 INFO L87 Difference]: Start difference. First operand 641 states and 919 transitions. Second operand 3 states. [2020-10-20 01:53:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:21,407 INFO L93 Difference]: Finished difference Result 1267 states and 1817 transitions. [2020-10-20 01:53:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:21,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:21,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:21,411 INFO L225 Difference]: With dead ends: 1267 [2020-10-20 01:53:21,412 INFO L226 Difference]: Without dead ends: 641 [2020-10-20 01:53:21,413 INFO L677 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 [2020-10-20 01:53:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-10-20 01:53:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2020-10-20 01:53:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-20 01:53:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 901 transitions. [2020-10-20 01:53:21,440 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 901 transitions. Word has length 73 [2020-10-20 01:53:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:21,441 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 901 transitions. [2020-10-20 01:53:21,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 901 transitions. [2020-10-20 01:53:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:21,442 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:21,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:21,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:53:21,443 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:21,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1887883821, now seen corresponding path program 1 times [2020-10-20 01:53:21,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:21,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256507571] [2020-10-20 01:53:21,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:21,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256507571] [2020-10-20 01:53:21,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:21,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:21,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371530138] [2020-10-20 01:53:21,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:21,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:21,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:21,480 INFO L87 Difference]: Start difference. First operand 641 states and 901 transitions. Second operand 3 states. [2020-10-20 01:53:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:21,547 INFO L93 Difference]: Finished difference Result 1266 states and 1780 transitions. [2020-10-20 01:53:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:21,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:21,551 INFO L225 Difference]: With dead ends: 1266 [2020-10-20 01:53:21,552 INFO L226 Difference]: Without dead ends: 641 [2020-10-20 01:53:21,553 INFO L677 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 [2020-10-20 01:53:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-10-20 01:53:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2020-10-20 01:53:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-20 01:53:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 883 transitions. [2020-10-20 01:53:21,580 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 883 transitions. Word has length 73 [2020-10-20 01:53:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:21,581 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 883 transitions. [2020-10-20 01:53:21,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 883 transitions. [2020-10-20 01:53:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:21,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:21,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:21,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:53:21,583 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1757929134, now seen corresponding path program 1 times [2020-10-20 01:53:21,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:21,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972581498] [2020-10-20 01:53:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:21,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972581498] [2020-10-20 01:53:21,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:21,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:21,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130303239] [2020-10-20 01:53:21,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:21,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:21,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:21,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:21,619 INFO L87 Difference]: Start difference. First operand 641 states and 883 transitions. Second operand 3 states. [2020-10-20 01:53:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:21,686 INFO L93 Difference]: Finished difference Result 1265 states and 1743 transitions. [2020-10-20 01:53:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:21,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:21,690 INFO L225 Difference]: With dead ends: 1265 [2020-10-20 01:53:21,691 INFO L226 Difference]: Without dead ends: 641 [2020-10-20 01:53:21,692 INFO L677 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 [2020-10-20 01:53:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2020-10-20 01:53:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2020-10-20 01:53:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-20 01:53:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 865 transitions. [2020-10-20 01:53:21,721 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 865 transitions. Word has length 73 [2020-10-20 01:53:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:21,722 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 865 transitions. [2020-10-20 01:53:21,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 865 transitions. [2020-10-20 01:53:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:21,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:21,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:21,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:53:21,724 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:21,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1024701678, now seen corresponding path program 1 times [2020-10-20 01:53:21,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:21,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750397168] [2020-10-20 01:53:21,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:21,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750397168] [2020-10-20 01:53:21,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:21,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:21,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043032896] [2020-10-20 01:53:21,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:21,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:21,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:21,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:21,771 INFO L87 Difference]: Start difference. First operand 641 states and 865 transitions. Second operand 5 states. [2020-10-20 01:53:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:21,934 INFO L93 Difference]: Finished difference Result 1647 states and 2245 transitions. [2020-10-20 01:53:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:21,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2020-10-20 01:53:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:21,940 INFO L225 Difference]: With dead ends: 1647 [2020-10-20 01:53:21,940 INFO L226 Difference]: Without dead ends: 1037 [2020-10-20 01:53:21,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2020-10-20 01:53:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 647. [2020-10-20 01:53:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-10-20 01:53:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 861 transitions. [2020-10-20 01:53:21,980 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 861 transitions. Word has length 73 [2020-10-20 01:53:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:21,980 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 861 transitions. [2020-10-20 01:53:21,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 861 transitions. [2020-10-20 01:53:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:21,982 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:21,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:21,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:53:21,983 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:21,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1918188016, now seen corresponding path program 1 times [2020-10-20 01:53:21,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:21,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424852602] [2020-10-20 01:53:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:22,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424852602] [2020-10-20 01:53:22,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:22,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:22,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364973606] [2020-10-20 01:53:22,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:22,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:22,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:22,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:22,027 INFO L87 Difference]: Start difference. First operand 647 states and 861 transitions. Second operand 5 states. [2020-10-20 01:53:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:22,187 INFO L93 Difference]: Finished difference Result 1700 states and 2283 transitions. [2020-10-20 01:53:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:22,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2020-10-20 01:53:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:22,193 INFO L225 Difference]: With dead ends: 1700 [2020-10-20 01:53:22,194 INFO L226 Difference]: Without dead ends: 1091 [2020-10-20 01:53:22,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2020-10-20 01:53:22,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 653. [2020-10-20 01:53:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2020-10-20 01:53:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 857 transitions. [2020-10-20 01:53:22,238 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 857 transitions. Word has length 73 [2020-10-20 01:53:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:22,239 INFO L481 AbstractCegarLoop]: Abstraction has 653 states and 857 transitions. [2020-10-20 01:53:22,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 857 transitions. [2020-10-20 01:53:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:22,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:22,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:22,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:53:22,241 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash 72820850, now seen corresponding path program 1 times [2020-10-20 01:53:22,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:22,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589800006] [2020-10-20 01:53:22,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:22,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589800006] [2020-10-20 01:53:22,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:22,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:22,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455680849] [2020-10-20 01:53:22,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:22,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:22,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:22,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:22,287 INFO L87 Difference]: Start difference. First operand 653 states and 857 transitions. Second operand 5 states. [2020-10-20 01:53:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:22,457 INFO L93 Difference]: Finished difference Result 1753 states and 2321 transitions. [2020-10-20 01:53:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:22,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2020-10-20 01:53:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:22,466 INFO L225 Difference]: With dead ends: 1753 [2020-10-20 01:53:22,466 INFO L226 Difference]: Without dead ends: 1145 [2020-10-20 01:53:22,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2020-10-20 01:53:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 659. [2020-10-20 01:53:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-10-20 01:53:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 853 transitions. [2020-10-20 01:53:22,524 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 853 transitions. Word has length 73 [2020-10-20 01:53:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:22,524 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 853 transitions. [2020-10-20 01:53:22,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 853 transitions. [2020-10-20 01:53:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:22,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:22,526 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:22,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:53:22,527 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash 434292, now seen corresponding path program 1 times [2020-10-20 01:53:22,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:22,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756378738] [2020-10-20 01:53:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:22,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756378738] [2020-10-20 01:53:22,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:22,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:22,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980776868] [2020-10-20 01:53:22,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:22,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:22,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:22,576 INFO L87 Difference]: Start difference. First operand 659 states and 853 transitions. Second operand 5 states. [2020-10-20 01:53:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:22,836 INFO L93 Difference]: Finished difference Result 1806 states and 2359 transitions. [2020-10-20 01:53:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:22,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2020-10-20 01:53:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:22,845 INFO L225 Difference]: With dead ends: 1806 [2020-10-20 01:53:22,845 INFO L226 Difference]: Without dead ends: 1199 [2020-10-20 01:53:22,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-10-20 01:53:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 665. [2020-10-20 01:53:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2020-10-20 01:53:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 849 transitions. [2020-10-20 01:53:22,937 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 849 transitions. Word has length 73 [2020-10-20 01:53:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:22,937 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 849 transitions. [2020-10-20 01:53:22,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 849 transitions. [2020-10-20 01:53:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:22,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:22,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:22,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:53:22,940 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1923662326, now seen corresponding path program 1 times [2020-10-20 01:53:22,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:22,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161426001] [2020-10-20 01:53:22,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:22,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161426001] [2020-10-20 01:53:22,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:22,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:22,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009787644] [2020-10-20 01:53:22,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:22,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:22,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:22,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:22,993 INFO L87 Difference]: Start difference. First operand 665 states and 849 transitions. Second operand 3 states. [2020-10-20 01:53:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:23,100 INFO L93 Difference]: Finished difference Result 1317 states and 1680 transitions. [2020-10-20 01:53:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:23,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:23,105 INFO L225 Difference]: With dead ends: 1317 [2020-10-20 01:53:23,106 INFO L226 Difference]: Without dead ends: 665 [2020-10-20 01:53:23,108 INFO L677 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 [2020-10-20 01:53:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-10-20 01:53:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2020-10-20 01:53:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2020-10-20 01:53:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 841 transitions. [2020-10-20 01:53:23,190 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 841 transitions. Word has length 73 [2020-10-20 01:53:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:23,191 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 841 transitions. [2020-10-20 01:53:23,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 841 transitions. [2020-10-20 01:53:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 01:53:23,193 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:23,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:23,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:53:23,194 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2142517044, now seen corresponding path program 1 times [2020-10-20 01:53:23,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:23,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857875923] [2020-10-20 01:53:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:23,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857875923] [2020-10-20 01:53:23,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:23,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:23,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850611399] [2020-10-20 01:53:23,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:23,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:23,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:23,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:23,238 INFO L87 Difference]: Start difference. First operand 665 states and 841 transitions. Second operand 3 states. [2020-10-20 01:53:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:23,457 INFO L93 Difference]: Finished difference Result 1884 states and 2366 transitions. [2020-10-20 01:53:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:23,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-10-20 01:53:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:23,466 INFO L225 Difference]: With dead ends: 1884 [2020-10-20 01:53:23,466 INFO L226 Difference]: Without dead ends: 1280 [2020-10-20 01:53:23,468 INFO L677 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 [2020-10-20 01:53:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2020-10-20 01:53:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1210. [2020-10-20 01:53:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2020-10-20 01:53:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1507 transitions. [2020-10-20 01:53:23,650 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1507 transitions. Word has length 73 [2020-10-20 01:53:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:23,651 INFO L481 AbstractCegarLoop]: Abstraction has 1210 states and 1507 transitions. [2020-10-20 01:53:23,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1507 transitions. [2020-10-20 01:53:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-20 01:53:23,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:23,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:23,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:53:23,654 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:23,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:23,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1551395071, now seen corresponding path program 1 times [2020-10-20 01:53:23,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:23,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410399964] [2020-10-20 01:53:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:23,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410399964] [2020-10-20 01:53:23,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:23,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:23,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468060444] [2020-10-20 01:53:23,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:23,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:23,711 INFO L87 Difference]: Start difference. First operand 1210 states and 1507 transitions. Second operand 3 states. [2020-10-20 01:53:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:24,004 INFO L93 Difference]: Finished difference Result 3200 states and 3989 transitions. [2020-10-20 01:53:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:24,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2020-10-20 01:53:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:24,018 INFO L225 Difference]: With dead ends: 3200 [2020-10-20 01:53:24,018 INFO L226 Difference]: Without dead ends: 2108 [2020-10-20 01:53:24,021 INFO L677 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 [2020-10-20 01:53:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2020-10-20 01:53:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2106. [2020-10-20 01:53:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-10-20 01:53:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 2608 transitions. [2020-10-20 01:53:24,310 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 2608 transitions. Word has length 74 [2020-10-20 01:53:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:24,311 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 2608 transitions. [2020-10-20 01:53:24,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2608 transitions. [2020-10-20 01:53:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-20 01:53:24,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:24,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:24,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:53:24,315 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1640750073, now seen corresponding path program 1 times [2020-10-20 01:53:24,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:24,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275267079] [2020-10-20 01:53:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:24,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275267079] [2020-10-20 01:53:24,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:24,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:24,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686419932] [2020-10-20 01:53:24,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:24,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:24,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:24,390 INFO L87 Difference]: Start difference. First operand 2106 states and 2608 transitions. Second operand 3 states. [2020-10-20 01:53:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:24,806 INFO L93 Difference]: Finished difference Result 5828 states and 7208 transitions. [2020-10-20 01:53:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:24,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-10-20 01:53:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:24,830 INFO L225 Difference]: With dead ends: 5828 [2020-10-20 01:53:24,831 INFO L226 Difference]: Without dead ends: 3840 [2020-10-20 01:53:24,838 INFO L677 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 [2020-10-20 01:53:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2020-10-20 01:53:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3838. [2020-10-20 01:53:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3838 states. [2020-10-20 01:53:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 4722 transitions. [2020-10-20 01:53:25,669 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 4722 transitions. Word has length 75 [2020-10-20 01:53:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:25,670 INFO L481 AbstractCegarLoop]: Abstraction has 3838 states and 4722 transitions. [2020-10-20 01:53:25,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 4722 transitions. [2020-10-20 01:53:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-20 01:53:25,673 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:25,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:25,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:53:25,674 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash -745759433, now seen corresponding path program 1 times [2020-10-20 01:53:25,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:25,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810023271] [2020-10-20 01:53:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:25,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810023271] [2020-10-20 01:53:25,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:25,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:25,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749881561] [2020-10-20 01:53:25,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:25,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:25,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:25,739 INFO L87 Difference]: Start difference. First operand 3838 states and 4722 transitions. Second operand 3 states. [2020-10-20 01:53:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:26,296 INFO L93 Difference]: Finished difference Result 7448 states and 9181 transitions. [2020-10-20 01:53:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:26,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-10-20 01:53:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:26,320 INFO L225 Difference]: With dead ends: 7448 [2020-10-20 01:53:26,320 INFO L226 Difference]: Without dead ends: 3728 [2020-10-20 01:53:26,329 INFO L677 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 [2020-10-20 01:53:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3728 states. [2020-10-20 01:53:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3728 to 3728. [2020-10-20 01:53:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3728 states. [2020-10-20 01:53:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3728 states to 3728 states and 4594 transitions. [2020-10-20 01:53:26,873 INFO L78 Accepts]: Start accepts. Automaton has 3728 states and 4594 transitions. Word has length 75 [2020-10-20 01:53:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:26,874 INFO L481 AbstractCegarLoop]: Abstraction has 3728 states and 4594 transitions. [2020-10-20 01:53:26,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3728 states and 4594 transitions. [2020-10-20 01:53:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-20 01:53:26,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:26,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:26,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:53:26,876 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:26,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1207843117, now seen corresponding path program 1 times [2020-10-20 01:53:26,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:26,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572739358] [2020-10-20 01:53:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:26,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572739358] [2020-10-20 01:53:26,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:26,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:26,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807564235] [2020-10-20 01:53:26,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:26,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:26,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:26,940 INFO L87 Difference]: Start difference. First operand 3728 states and 4594 transitions. Second operand 3 states. [2020-10-20 01:53:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:27,445 INFO L93 Difference]: Finished difference Result 10346 states and 12734 transitions. [2020-10-20 01:53:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:27,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-10-20 01:53:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:27,490 INFO L225 Difference]: With dead ends: 10346 [2020-10-20 01:53:27,491 INFO L226 Difference]: Without dead ends: 6736 [2020-10-20 01:53:27,496 INFO L677 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 [2020-10-20 01:53:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2020-10-20 01:53:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 6734. [2020-10-20 01:53:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6734 states. [2020-10-20 01:53:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6734 states to 6734 states and 8252 transitions. [2020-10-20 01:53:28,036 INFO L78 Accepts]: Start accepts. Automaton has 6734 states and 8252 transitions. Word has length 76 [2020-10-20 01:53:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:28,037 INFO L481 AbstractCegarLoop]: Abstraction has 6734 states and 8252 transitions. [2020-10-20 01:53:28,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6734 states and 8252 transitions. [2020-10-20 01:53:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-20 01:53:28,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:28,039 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:28,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:53:28,040 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1178666389, now seen corresponding path program 1 times [2020-10-20 01:53:28,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:28,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961254951] [2020-10-20 01:53:28,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:28,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961254951] [2020-10-20 01:53:28,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:28,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:28,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334403254] [2020-10-20 01:53:28,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:28,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:28,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:28,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:28,063 INFO L87 Difference]: Start difference. First operand 6734 states and 8252 transitions. Second operand 3 states. [2020-10-20 01:53:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:28,692 INFO L93 Difference]: Finished difference Result 13242 states and 16247 transitions. [2020-10-20 01:53:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:28,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-10-20 01:53:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:28,706 INFO L225 Difference]: With dead ends: 13242 [2020-10-20 01:53:28,706 INFO L226 Difference]: Without dead ends: 6626 [2020-10-20 01:53:28,715 INFO L677 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 [2020-10-20 01:53:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2020-10-20 01:53:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6626. [2020-10-20 01:53:29,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6626 states. [2020-10-20 01:53:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 8128 transitions. [2020-10-20 01:53:29,168 INFO L78 Accepts]: Start accepts. Automaton has 6626 states and 8128 transitions. Word has length 76 [2020-10-20 01:53:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:29,168 INFO L481 AbstractCegarLoop]: Abstraction has 6626 states and 8128 transitions. [2020-10-20 01:53:29,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6626 states and 8128 transitions. [2020-10-20 01:53:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-20 01:53:29,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:29,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:29,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:53:29,171 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1123498955, now seen corresponding path program 1 times [2020-10-20 01:53:29,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:29,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993460770] [2020-10-20 01:53:29,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:29,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993460770] [2020-10-20 01:53:29,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:29,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:29,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498762069] [2020-10-20 01:53:29,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:29,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:29,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:29,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:29,213 INFO L87 Difference]: Start difference. First operand 6626 states and 8128 transitions. Second operand 3 states. [2020-10-20 01:53:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:30,328 INFO L93 Difference]: Finished difference Result 19474 states and 23887 transitions. [2020-10-20 01:53:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:30,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-10-20 01:53:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:30,355 INFO L225 Difference]: With dead ends: 19474 [2020-10-20 01:53:30,355 INFO L226 Difference]: Without dead ends: 12938 [2020-10-20 01:53:30,367 INFO L677 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 [2020-10-20 01:53:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12938 states. [2020-10-20 01:53:31,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12938 to 12874. [2020-10-20 01:53:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12874 states. [2020-10-20 01:53:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12874 states to 12874 states and 15654 transitions. [2020-10-20 01:53:31,393 INFO L78 Accepts]: Start accepts. Automaton has 12874 states and 15654 transitions. Word has length 77 [2020-10-20 01:53:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:31,393 INFO L481 AbstractCegarLoop]: Abstraction has 12874 states and 15654 transitions. [2020-10-20 01:53:31,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 12874 states and 15654 transitions. [2020-10-20 01:53:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-20 01:53:31,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:31,399 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:53:31,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:53:31,399 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash -494915717, now seen corresponding path program 1 times [2020-10-20 01:53:31,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:31,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41207525] [2020-10-20 01:53:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:31,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41207525] [2020-10-20 01:53:31,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:31,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:31,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060616508] [2020-10-20 01:53:31,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:31,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:31,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:31,454 INFO L87 Difference]: Start difference. First operand 12874 states and 15654 transitions. Second operand 4 states. [2020-10-20 01:53:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:33,482 INFO L93 Difference]: Finished difference Result 38268 states and 46465 transitions. [2020-10-20 01:53:33,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:33,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2020-10-20 01:53:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:33,524 INFO L225 Difference]: With dead ends: 38268 [2020-10-20 01:53:33,524 INFO L226 Difference]: Without dead ends: 19220 [2020-10-20 01:53:33,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19220 states. [2020-10-20 01:53:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19220 to 19220. [2020-10-20 01:53:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19220 states. [2020-10-20 01:53:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19220 states to 19220 states and 23314 transitions. [2020-10-20 01:53:34,927 INFO L78 Accepts]: Start accepts. Automaton has 19220 states and 23314 transitions. Word has length 96 [2020-10-20 01:53:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:34,927 INFO L481 AbstractCegarLoop]: Abstraction has 19220 states and 23314 transitions. [2020-10-20 01:53:34,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 19220 states and 23314 transitions. [2020-10-20 01:53:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-10-20 01:53:34,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:34,939 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:53:34,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 01:53:34,940 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2108229190, now seen corresponding path program 1 times [2020-10-20 01:53:34,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:34,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084983743] [2020-10-20 01:53:34,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-10-20 01:53:34,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084983743] [2020-10-20 01:53:34,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:34,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:34,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130224881] [2020-10-20 01:53:34,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:34,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:34,998 INFO L87 Difference]: Start difference. First operand 19220 states and 23314 transitions. Second operand 3 states. [2020-10-20 01:53:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:36,834 INFO L93 Difference]: Finished difference Result 44030 states and 53355 transitions. [2020-10-20 01:53:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:36,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-10-20 01:53:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:36,874 INFO L225 Difference]: With dead ends: 44030 [2020-10-20 01:53:36,874 INFO L226 Difference]: Without dead ends: 24886 [2020-10-20 01:53:36,892 INFO L677 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 [2020-10-20 01:53:36,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24886 states. [2020-10-20 01:53:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24886 to 24790. [2020-10-20 01:53:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24790 states. [2020-10-20 01:53:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24790 states to 24790 states and 29902 transitions. [2020-10-20 01:53:38,002 INFO L78 Accepts]: Start accepts. Automaton has 24790 states and 29902 transitions. Word has length 131 [2020-10-20 01:53:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:38,002 INFO L481 AbstractCegarLoop]: Abstraction has 24790 states and 29902 transitions. [2020-10-20 01:53:38,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 24790 states and 29902 transitions. [2020-10-20 01:53:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-10-20 01:53:38,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:38,017 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:53:38,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 01:53:38,017 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:38,018 INFO L82 PathProgramCache]: Analyzing trace with hash -307341713, now seen corresponding path program 1 times [2020-10-20 01:53:38,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:38,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102003159] [2020-10-20 01:53:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:38,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102003159] [2020-10-20 01:53:38,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:38,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:38,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574968077] [2020-10-20 01:53:38,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:38,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:38,075 INFO L87 Difference]: Start difference. First operand 24790 states and 29902 transitions. Second operand 4 states. [2020-10-20 01:53:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:39,980 INFO L93 Difference]: Finished difference Result 43896 states and 53090 transitions. [2020-10-20 01:53:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:39,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-10-20 01:53:39,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:40,011 INFO L225 Difference]: With dead ends: 43896 [2020-10-20 01:53:40,011 INFO L226 Difference]: Without dead ends: 24792 [2020-10-20 01:53:40,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24792 states. [2020-10-20 01:53:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24792 to 24790. [2020-10-20 01:53:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24790 states. [2020-10-20 01:53:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24790 states to 24790 states and 29836 transitions. [2020-10-20 01:53:41,282 INFO L78 Accepts]: Start accepts. Automaton has 24790 states and 29836 transitions. Word has length 134 [2020-10-20 01:53:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:41,283 INFO L481 AbstractCegarLoop]: Abstraction has 24790 states and 29836 transitions. [2020-10-20 01:53:41,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 24790 states and 29836 transitions. [2020-10-20 01:53:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-10-20 01:53:41,299 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:41,299 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:53:41,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 01:53:41,300 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:41,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:41,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1829407028, now seen corresponding path program 1 times [2020-10-20 01:53:41,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:41,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635312138] [2020-10-20 01:53:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-20 01:53:41,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635312138] [2020-10-20 01:53:41,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:41,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:41,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21033363] [2020-10-20 01:53:41,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:41,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:41,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:41,446 INFO L87 Difference]: Start difference. First operand 24790 states and 29836 transitions. Second operand 3 states. [2020-10-20 01:53:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:42,884 INFO L93 Difference]: Finished difference Result 54548 states and 65551 transitions. [2020-10-20 01:53:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:42,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-10-20 01:53:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:42,915 INFO L225 Difference]: With dead ends: 54548 [2020-10-20 01:53:42,916 INFO L226 Difference]: Without dead ends: 29820 [2020-10-20 01:53:42,930 INFO L677 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 [2020-10-20 01:53:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29820 states. [2020-10-20 01:53:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29820 to 29692. [2020-10-20 01:53:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29692 states. [2020-10-20 01:53:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29692 states to 29692 states and 35544 transitions. [2020-10-20 01:53:45,390 INFO L78 Accepts]: Start accepts. Automaton has 29692 states and 35544 transitions. Word has length 169 [2020-10-20 01:53:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:45,390 INFO L481 AbstractCegarLoop]: Abstraction has 29692 states and 35544 transitions. [2020-10-20 01:53:45,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29692 states and 35544 transitions. [2020-10-20 01:53:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-10-20 01:53:45,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:45,406 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:45,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 01:53:45,407 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:45,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1186786501, now seen corresponding path program 1 times [2020-10-20 01:53:45,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:45,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832084883] [2020-10-20 01:53:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:45,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832084883] [2020-10-20 01:53:45,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:45,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:45,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379853424] [2020-10-20 01:53:45,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:45,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:45,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:45,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:45,478 INFO L87 Difference]: Start difference. First operand 29692 states and 35544 transitions. Second operand 4 states. [2020-10-20 01:53:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:47,179 INFO L93 Difference]: Finished difference Result 54370 states and 65258 transitions. [2020-10-20 01:53:47,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:47,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2020-10-20 01:53:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:47,205 INFO L225 Difference]: With dead ends: 54370 [2020-10-20 01:53:47,206 INFO L226 Difference]: Without dead ends: 29694 [2020-10-20 01:53:47,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29694 states. [2020-10-20 01:53:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29694 to 29692. [2020-10-20 01:53:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29692 states. [2020-10-20 01:53:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29692 states to 29692 states and 35432 transitions. [2020-10-20 01:53:49,275 INFO L78 Accepts]: Start accepts. Automaton has 29692 states and 35432 transitions. Word has length 172 [2020-10-20 01:53:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:49,275 INFO L481 AbstractCegarLoop]: Abstraction has 29692 states and 35432 transitions. [2020-10-20 01:53:49,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 29692 states and 35432 transitions. [2020-10-20 01:53:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-10-20 01:53:49,289 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:49,290 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-20 01:53:49,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 01:53:49,290 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash 559094458, now seen corresponding path program 1 times [2020-10-20 01:53:49,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:49,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547514173] [2020-10-20 01:53:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 01:53:49,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547514173] [2020-10-20 01:53:49,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:49,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:49,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418554076] [2020-10-20 01:53:49,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:49,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:49,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:49,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:49,365 INFO L87 Difference]: Start difference. First operand 29692 states and 35432 transitions. Second operand 3 states. [2020-10-20 01:53:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:51,465 INFO L93 Difference]: Finished difference Result 63734 states and 75903 transitions. [2020-10-20 01:53:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:51,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2020-10-20 01:53:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:51,496 INFO L225 Difference]: With dead ends: 63734 [2020-10-20 01:53:51,496 INFO L226 Difference]: Without dead ends: 34090 [2020-10-20 01:53:51,512 INFO L677 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 [2020-10-20 01:53:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34090 states. [2020-10-20 01:53:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34090 to 33930. [2020-10-20 01:53:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33930 states. [2020-10-20 01:53:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33930 states to 33930 states and 40268 transitions. [2020-10-20 01:53:52,903 INFO L78 Accepts]: Start accepts. Automaton has 33930 states and 40268 transitions. Word has length 207 [2020-10-20 01:53:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:52,903 INFO L481 AbstractCegarLoop]: Abstraction has 33930 states and 40268 transitions. [2020-10-20 01:53:52,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33930 states and 40268 transitions. [2020-10-20 01:53:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-10-20 01:53:52,923 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:52,923 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:52,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 01:53:52,923 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1688974701, now seen corresponding path program 1 times [2020-10-20 01:53:52,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:52,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500069917] [2020-10-20 01:53:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:52,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500069917] [2020-10-20 01:53:52,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:52,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:52,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869786593] [2020-10-20 01:53:52,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:52,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:52,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:52,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:52,991 INFO L87 Difference]: Start difference. First operand 33930 states and 40268 transitions. Second operand 4 states. [2020-10-20 01:53:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:54,706 INFO L93 Difference]: Finished difference Result 63512 states and 75582 transitions. [2020-10-20 01:53:54,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:54,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2020-10-20 01:53:54,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:54,732 INFO L225 Difference]: With dead ends: 63512 [2020-10-20 01:53:54,732 INFO L226 Difference]: Without dead ends: 33932 [2020-10-20 01:53:54,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33932 states. [2020-10-20 01:53:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33932 to 33930. [2020-10-20 01:53:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33930 states. [2020-10-20 01:53:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33930 states to 33930 states and 40068 transitions. [2020-10-20 01:53:57,435 INFO L78 Accepts]: Start accepts. Automaton has 33930 states and 40068 transitions. Word has length 210 [2020-10-20 01:53:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:57,435 INFO L481 AbstractCegarLoop]: Abstraction has 33930 states and 40068 transitions. [2020-10-20 01:53:57,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 33930 states and 40068 transitions. [2020-10-20 01:53:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-10-20 01:53:57,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:57,451 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:57,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-20 01:53:57,451 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:57,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash 346344481, now seen corresponding path program 1 times [2020-10-20 01:53:57,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:57,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392298550] [2020-10-20 01:53:57,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:53:57,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392298550] [2020-10-20 01:53:57,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:57,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:57,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368887] [2020-10-20 01:53:57,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:57,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:57,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:57,543 INFO L87 Difference]: Start difference. First operand 33930 states and 40068 transitions. Second operand 5 states. [2020-10-20 01:54:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:01,101 INFO L93 Difference]: Finished difference Result 107911 states and 126916 transitions. [2020-10-20 01:54:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:54:01,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2020-10-20 01:54:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:01,170 INFO L225 Difference]: With dead ends: 107911 [2020-10-20 01:54:01,170 INFO L226 Difference]: Without dead ends: 74058 [2020-10-20 01:54:01,193 INFO L677 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 [2020-10-20 01:54:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74058 states. [2020-10-20 01:54:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74058 to 34938. [2020-10-20 01:54:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34938 states. [2020-10-20 01:54:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34938 states to 34938 states and 40834 transitions. [2020-10-20 01:54:03,409 INFO L78 Accepts]: Start accepts. Automaton has 34938 states and 40834 transitions. Word has length 245 [2020-10-20 01:54:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:03,409 INFO L481 AbstractCegarLoop]: Abstraction has 34938 states and 40834 transitions. [2020-10-20 01:54:03,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:54:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 34938 states and 40834 transitions. [2020-10-20 01:54:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2020-10-20 01:54:03,424 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:03,424 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:03,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-20 01:54:03,425 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 378842785, now seen corresponding path program 1 times [2020-10-20 01:54:03,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:03,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220171345] [2020-10-20 01:54:03,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:03,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220171345] [2020-10-20 01:54:03,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:03,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:03,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498436004] [2020-10-20 01:54:03,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:03,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:03,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:03,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:03,504 INFO L87 Difference]: Start difference. First operand 34938 states and 40834 transitions. Second operand 3 states. [2020-10-20 01:54:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:05,594 INFO L93 Difference]: Finished difference Result 62586 states and 73359 transitions. [2020-10-20 01:54:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:05,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2020-10-20 01:54:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:05,628 INFO L225 Difference]: With dead ends: 62586 [2020-10-20 01:54:05,628 INFO L226 Difference]: Without dead ends: 35002 [2020-10-20 01:54:05,647 INFO L677 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 [2020-10-20 01:54:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35002 states. [2020-10-20 01:54:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35002 to 34938. [2020-10-20 01:54:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34938 states. [2020-10-20 01:54:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34938 states to 34938 states and 40242 transitions. [2020-10-20 01:54:07,590 INFO L78 Accepts]: Start accepts. Automaton has 34938 states and 40242 transitions. Word has length 245 [2020-10-20 01:54:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:07,590 INFO L481 AbstractCegarLoop]: Abstraction has 34938 states and 40242 transitions. [2020-10-20 01:54:07,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 34938 states and 40242 transitions. [2020-10-20 01:54:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2020-10-20 01:54:07,607 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:07,607 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:07,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-20 01:54:07,608 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:07,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1600094544, now seen corresponding path program 1 times [2020-10-20 01:54:07,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:07,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547921648] [2020-10-20 01:54:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:07,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547921648] [2020-10-20 01:54:07,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:07,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:07,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917125511] [2020-10-20 01:54:07,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:07,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:07,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:07,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:07,676 INFO L87 Difference]: Start difference. First operand 34938 states and 40242 transitions. Second operand 3 states. [2020-10-20 01:54:09,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:09,637 INFO L93 Difference]: Finished difference Result 59358 states and 68559 transitions. [2020-10-20 01:54:09,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:09,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2020-10-20 01:54:09,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:09,669 INFO L225 Difference]: With dead ends: 59358 [2020-10-20 01:54:09,669 INFO L226 Difference]: Without dead ends: 35002 [2020-10-20 01:54:09,683 INFO L677 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 [2020-10-20 01:54:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35002 states. [2020-10-20 01:54:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35002 to 34938. [2020-10-20 01:54:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34938 states. [2020-10-20 01:54:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34938 states to 34938 states and 39738 transitions. [2020-10-20 01:54:11,570 INFO L78 Accepts]: Start accepts. Automaton has 34938 states and 39738 transitions. Word has length 248 [2020-10-20 01:54:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:11,571 INFO L481 AbstractCegarLoop]: Abstraction has 34938 states and 39738 transitions. [2020-10-20 01:54:11,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 34938 states and 39738 transitions. [2020-10-20 01:54:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2020-10-20 01:54:11,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:11,589 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:11,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-20 01:54:11,589 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:11,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:11,590 INFO L82 PathProgramCache]: Analyzing trace with hash 333289526, now seen corresponding path program 1 times [2020-10-20 01:54:11,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:11,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325814659] [2020-10-20 01:54:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:11,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325814659] [2020-10-20 01:54:11,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:11,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:11,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644943740] [2020-10-20 01:54:11,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:11,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:11,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:11,671 INFO L87 Difference]: Start difference. First operand 34938 states and 39738 transitions. Second operand 3 states. [2020-10-20 01:54:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:13,540 INFO L93 Difference]: Finished difference Result 55714 states and 63535 transitions. [2020-10-20 01:54:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:13,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2020-10-20 01:54:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:13,574 INFO L225 Difference]: With dead ends: 55714 [2020-10-20 01:54:13,574 INFO L226 Difference]: Without dead ends: 34938 [2020-10-20 01:54:13,594 INFO L677 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 [2020-10-20 01:54:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34938 states. [2020-10-20 01:54:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34938 to 34876. [2020-10-20 01:54:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34876 states. [2020-10-20 01:54:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34876 states to 34876 states and 39268 transitions. [2020-10-20 01:54:15,714 INFO L78 Accepts]: Start accepts. Automaton has 34876 states and 39268 transitions. Word has length 251 [2020-10-20 01:54:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:15,715 INFO L481 AbstractCegarLoop]: Abstraction has 34876 states and 39268 transitions. [2020-10-20 01:54:15,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 34876 states and 39268 transitions. [2020-10-20 01:54:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-10-20 01:54:15,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:15,729 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:15,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-20 01:54:15,729 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash 391416485, now seen corresponding path program 1 times [2020-10-20 01:54:15,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:15,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106641093] [2020-10-20 01:54:15,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:54:15,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106641093] [2020-10-20 01:54:15,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:15,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:15,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685648698] [2020-10-20 01:54:15,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:15,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:15,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:15,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:15,808 INFO L87 Difference]: Start difference. First operand 34876 states and 39268 transitions. Second operand 3 states. [2020-10-20 01:54:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:17,462 INFO L93 Difference]: Finished difference Result 62718 states and 70171 transitions. [2020-10-20 01:54:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:17,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2020-10-20 01:54:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:17,478 INFO L225 Difference]: With dead ends: 62718 [2020-10-20 01:54:17,478 INFO L226 Difference]: Without dead ends: 16774 [2020-10-20 01:54:17,498 INFO L677 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 [2020-10-20 01:54:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16774 states. [2020-10-20 01:54:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16774 to 16254. [2020-10-20 01:54:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16254 states. [2020-10-20 01:54:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16254 states to 16254 states and 17696 transitions. [2020-10-20 01:54:18,272 INFO L78 Accepts]: Start accepts. Automaton has 16254 states and 17696 transitions. Word has length 254 [2020-10-20 01:54:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:18,273 INFO L481 AbstractCegarLoop]: Abstraction has 16254 states and 17696 transitions. [2020-10-20 01:54:18,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 16254 states and 17696 transitions. [2020-10-20 01:54:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-10-20 01:54:18,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:18,285 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:18,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-20 01:54:18,285 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1392087481, now seen corresponding path program 1 times [2020-10-20 01:54:18,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:18,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605991916] [2020-10-20 01:54:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:54:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:54:18,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605991916] [2020-10-20 01:54:18,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:54:18,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:54:18,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651139456] [2020-10-20 01:54:18,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:54:18,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:54:18,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:54:18,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:54:18,375 INFO L87 Difference]: Start difference. First operand 16254 states and 17696 transitions. Second operand 3 states. [2020-10-20 01:54:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:54:19,367 INFO L93 Difference]: Finished difference Result 28760 states and 31355 transitions. [2020-10-20 01:54:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:54:19,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2020-10-20 01:54:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:54:19,382 INFO L225 Difference]: With dead ends: 28760 [2020-10-20 01:54:19,382 INFO L226 Difference]: Without dead ends: 16254 [2020-10-20 01:54:19,391 INFO L677 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 [2020-10-20 01:54:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16254 states. [2020-10-20 01:54:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16254 to 16254. [2020-10-20 01:54:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16254 states. [2020-10-20 01:54:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16254 states to 16254 states and 17530 transitions. [2020-10-20 01:54:20,173 INFO L78 Accepts]: Start accepts. Automaton has 16254 states and 17530 transitions. Word has length 257 [2020-10-20 01:54:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:54:20,174 INFO L481 AbstractCegarLoop]: Abstraction has 16254 states and 17530 transitions. [2020-10-20 01:54:20,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:54:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 16254 states and 17530 transitions. [2020-10-20 01:54:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-10-20 01:54:20,185 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:54:20,185 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:54:20,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-20 01:54:20,186 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:54:20,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:54:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1978087514, now seen corresponding path program 1 times [2020-10-20 01:54:20,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:54:20,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677766130] [2020-10-20 01:54:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:54:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:54:20,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:54:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:54:20,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:54:20,384 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:54:20,384 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:54:20,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-20 01:54:20,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:54:20 BoogieIcfgContainer [2020-10-20 01:54:20,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:54:20,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:54:20,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:54:20,709 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:54:20,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:19" (3/4) ... [2020-10-20 01:54:20,713 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:54:21,016 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:54:21,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:54:21,019 INFO L168 Benchmark]: Toolchain (without parser) took 63186.70 ms. Allocated memory was 36.7 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 19.7 MB in the beginning and 450.2 MB in the end (delta: -430.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 14.3 GB. [2020-10-20 01:54:21,019 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 33.6 MB. Free memory was 12.0 MB in the beginning and 12.0 MB in the end (delta: 47.6 kB). Peak memory consumption was 47.6 kB. Max. memory is 14.3 GB. [2020-10-20 01:54:21,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.75 ms. Allocated memory was 36.7 MB in the beginning and 44.0 MB in the end (delta: 7.3 MB). Free memory was 18.8 MB in the beginning and 20.6 MB in the end (delta: -1.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:21,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.22 ms. Allocated memory is still 44.0 MB. Free memory was 20.6 MB in the beginning and 16.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:21,022 INFO L168 Benchmark]: Boogie Preprocessor took 80.00 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 15.9 MB in the beginning and 25.9 MB in the end (delta: -9.9 MB). Peak memory consumption was 5.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:21,022 INFO L168 Benchmark]: RCFGBuilder took 1163.68 ms. Allocated memory was 46.1 MB in the beginning and 52.4 MB in the end (delta: 6.3 MB). Free memory was 25.9 MB in the beginning and 19.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 19.6 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:21,023 INFO L168 Benchmark]: TraceAbstraction took 61095.04 ms. Allocated memory was 52.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 18.6 MB in the beginning and 482.4 MB in the end (delta: -463.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 14.3 GB. [2020-10-20 01:54:21,023 INFO L168 Benchmark]: Witness Printer took 308.11 ms. Allocated memory is still 2.1 GB. Free memory was 482.4 MB in the beginning and 450.2 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:54:21,026 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 33.6 MB. Free memory was 12.0 MB in the beginning and 12.0 MB in the end (delta: 47.6 kB). Peak memory consumption was 47.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 460.75 ms. Allocated memory was 36.7 MB in the beginning and 44.0 MB in the end (delta: 7.3 MB). Free memory was 18.8 MB in the beginning and 20.6 MB in the end (delta: -1.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 68.22 ms. Allocated memory is still 44.0 MB. Free memory was 20.6 MB in the beginning and 16.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 80.00 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 15.9 MB in the beginning and 25.9 MB in the end (delta: -9.9 MB). Peak memory consumption was 5.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1163.68 ms. Allocated memory was 46.1 MB in the beginning and 52.4 MB in the end (delta: 6.3 MB). Free memory was 25.9 MB in the beginning and 19.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 19.6 MB. Max. memory is 14.3 GB. * TraceAbstraction took 61095.04 ms. Allocated memory was 52.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 18.6 MB in the beginning and 482.4 MB in the end (delta: -463.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 14.3 GB. * Witness Printer took 308.11 ms. Allocated memory is still 2.1 GB. Free memory was 482.4 MB in the beginning and 450.2 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int t3_pc = 0; [L21] int t4_pc = 0; [L22] int m_st ; [L23] int t1_st ; [L24] int t2_st ; [L25] int t3_st ; [L26] int t4_st ; [L27] int m_i ; [L28] int t1_i ; [L29] int t2_i ; [L30] int t3_i ; [L31] int t4_i ; [L32] int M_E = 2; [L33] int T1_E = 2; [L34] int T2_E = 2; [L35] int T3_E = 2; [L36] int T4_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L39] int E_3 = 2; [L40] int E_4 = 2; VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L813] int __retres1 ; [L725] m_i = 1 [L726] t1_i = 1 [L727] t2_i = 1 [L728] t3_i = 1 [L729] t4_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L754] int kernel_st ; [L755] int tmp ; [L756] int tmp___0 ; [L760] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L333] COND TRUE m_i == 1 [L334] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L338] COND TRUE t1_i == 1 [L339] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L343] COND TRUE t2_i == 1 [L344] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L348] COND TRUE t3_i == 1 [L349] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L353] COND TRUE t4_i == 1 [L354] t4_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L494] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L499] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L504] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L509] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L514] COND FALSE !(T4_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L519] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L524] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L529] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L534] COND FALSE !(E_4 == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L230] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L240] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L242] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L246] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L249] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L259] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L261] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L265] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L268] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L278] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L280] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L284] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L287] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L297] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L299] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L303] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L306] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L316] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L318] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L547] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L552] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L557] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L562] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L567] COND FALSE !(T4_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L572] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L577] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L582] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L587] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L768] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L771] kernel_st = 1 [L399] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L403] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L363] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L366] COND TRUE m_st == 0 [L367] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L394] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L406] tmp = exists_runnable_thread() [L408] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L413] COND TRUE m_st == 0 [L414] int tmp_ndt_1; [L415] tmp_ndt_1 = __VERIFIER_nondet_int() [L416] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L427] COND TRUE t1_st == 0 [L428] int tmp_ndt_2; [L429] tmp_ndt_2 = __VERIFIER_nondet_int() [L430] COND TRUE \read(tmp_ndt_2) [L432] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L92] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L103] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L441] COND TRUE t2_st == 0 [L442] int tmp_ndt_3; [L443] tmp_ndt_3 = __VERIFIER_nondet_int() [L444] COND TRUE \read(tmp_ndt_3) [L446] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L127] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L138] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L140] t2_pc = 1 [L141] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L455] COND TRUE t3_st == 0 [L456] int tmp_ndt_4; [L457] tmp_ndt_4 = __VERIFIER_nondet_int() [L458] COND TRUE \read(tmp_ndt_4) [L460] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L162] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L173] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L175] t3_pc = 1 [L176] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L469] COND TRUE t4_st == 0 [L470] int tmp_ndt_5; [L471] tmp_ndt_5 = __VERIFIER_nondet_int() [L472] COND TRUE \read(tmp_ndt_5) [L474] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L197] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L208] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L210] t4_pc = 1 [L211] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L403] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L363] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L366] COND TRUE m_st == 0 [L367] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L394] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L406] tmp = exists_runnable_thread() [L408] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L413] COND TRUE m_st == 0 [L414] int tmp_ndt_1; [L415] tmp_ndt_1 = __VERIFIER_nondet_int() [L416] COND TRUE \read(tmp_ndt_1) [L418] m_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L51] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L62] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L65] E_1 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L230] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L240] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L242] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L246] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L249] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L250] COND TRUE E_1 == 1 [L251] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L261] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L613] tmp___0 = is_transmit1_triggered() [L615] COND TRUE \read(tmp___0) [L616] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L265] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L268] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L269] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L278] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L280] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L284] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L287] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L288] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L297] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L299] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L303] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L306] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L307] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L316] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L318] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) VAL [E_1=1, E_2=2, E_3=2, E_4=2, 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] [L67] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L70] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L72] m_pc = 1 [L73] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L427] COND TRUE t1_st == 0 [L428] int tmp_ndt_2; [L429] tmp_ndt_2 = __VERIFIER_nondet_int() [L430] COND TRUE \read(tmp_ndt_2) [L432] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L95] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L111] E_2 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L230] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L231] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L240] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L242] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L246] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L249] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L250] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L259] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L261] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L265] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L268] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L269] COND TRUE E_2 == 1 [L270] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L280] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L621] tmp___1 = is_transmit2_triggered() [L623] COND TRUE \read(tmp___1) [L624] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L284] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L287] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L288] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L297] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L299] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L303] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L306] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L307] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L316] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L318] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=1, E_3=2, E_4=2, 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] [L113] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L103] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L441] COND TRUE t2_st == 0 [L442] int tmp_ndt_3; [L443] tmp_ndt_3 = __VERIFIER_nondet_int() [L444] COND TRUE \read(tmp_ndt_3) [L446] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L127] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L130] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L146] E_3 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L230] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L231] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L240] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L242] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L246] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L249] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L250] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L259] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L261] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L265] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L268] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L269] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L278] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L280] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L284] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L287] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L288] COND TRUE E_3 == 1 [L289] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L299] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L629] tmp___2 = is_transmit3_triggered() [L631] COND TRUE \read(tmp___2) [L632] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L303] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L306] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L307] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L316] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L318] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) VAL [E_1=2, E_2=2, E_3=1, E_4=2, 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] [L148] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L138] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L140] t2_pc = 1 [L141] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L455] COND TRUE t3_st == 0 [L456] int tmp_ndt_4; [L457] tmp_ndt_4 = __VERIFIER_nondet_int() [L458] COND TRUE \read(tmp_ndt_4) [L460] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L162] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L165] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L181] E_4 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L230] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L231] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L240] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L242] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L246] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L249] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L250] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L259] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L261] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L265] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L268] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L269] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L278] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L280] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L284] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L287] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L288] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L297] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L299] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L303] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L306] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L307] COND TRUE E_4 == 1 [L308] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L318] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L637] tmp___3 = is_transmit4_triggered() [L639] COND TRUE \read(tmp___3) [L640] t4_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, 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] [L183] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L173] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L175] t3_pc = 1 [L176] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L469] COND TRUE t4_st == 0 [L470] int tmp_ndt_5; [L471] tmp_ndt_5 = __VERIFIER_nondet_int() [L472] COND TRUE \read(tmp_ndt_5) [L474] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L197] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L200] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] [L3] __assert_fail("0", "transmitter.04.cil.c", 3, "reach_error") VAL [E_1=2, E_2=2, E_3=2, E_4=2, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 375 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 60.7s, OverallIterations: 35, TraceHistogramMax: 2, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18906 SDtfs, 19454 SDslu, 13432 SDs, 0 SdLazy, 800 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34938occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 42210 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 4427 NumberOfCodeBlocks, 4427 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4133 ConstructedInterpolants, 0 QuantifiedInterpolants, 984805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 302/302 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...