./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer --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 f6768ec4cb10c0d030986cdc2e459713dbcdaadd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-a4ecdab [2020-11-28 02:57:07,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:57:07,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:57:07,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:57:07,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:57:07,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:57:07,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:57:07,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:57:07,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:57:07,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:57:07,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:57:07,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:57:07,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:57:07,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:57:07,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:57:07,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:57:07,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:57:07,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:57:07,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:57:07,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:57:07,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:57:07,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:57:07,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:57:07,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:57:07,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:57:07,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:57:07,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:57:07,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:57:07,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:57:07,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:57:07,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:57:07,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:57:07,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:57:07,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:57:07,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:57:07,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:57:07,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:57:07,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:57:07,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:57:07,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:57:07,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:57:07,868 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 02:57:07,889 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:57:07,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:57:07,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:57:07,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:57:07,891 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:57:07,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:57:07,892 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:57:07,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:57:07,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:57:07,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:57:07,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 02:57:07,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 02:57:07,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 02:57:07,893 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:57:07,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:57:07,893 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:57:07,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 02:57:07,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:57:07,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:57:07,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 02:57:07,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 02:57:07,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:57:07,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:57:07,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 02:57:07,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 02:57:07,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:57:07,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 02:57:07,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 02:57:07,896 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:57:07,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer 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 -> f6768ec4cb10c0d030986cdc2e459713dbcdaadd [2020-11-28 02:57:08,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:57:08,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:57:08,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:57:08,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:57:08,189 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:57:08,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-11-28 02:57:08,285 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/data/cd2ed7953/26126fcefd0542baa50d3327e56aee9c/FLAG86efea6b3 [2020-11-28 02:57:08,744 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:57:08,744 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-11-28 02:57:08,753 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/data/cd2ed7953/26126fcefd0542baa50d3327e56aee9c/FLAG86efea6b3 [2020-11-28 02:57:09,117 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/data/cd2ed7953/26126fcefd0542baa50d3327e56aee9c [2020-11-28 02:57:09,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:57:09,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:57:09,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:57:09,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:57:09,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:57:09,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655dbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09, skipping insertion in model container [2020-11-28 02:57:09,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:57:09,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:57:09,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:57:09,451 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:57:09,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:57:09,557 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:57:09,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09 WrapperNode [2020-11-28 02:57:09,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:57:09,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:57:09,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:57:09,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:57:09,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:57:09,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:57:09,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:57:09,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:57:09,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... [2020-11-28 02:57:09,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:57:09,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:57:09,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:57:09,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:57:09,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/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-11-28 02:57:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:57:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 02:57:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:57:09,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:57:11,060 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:57:11,064 INFO L298 CfgBuilder]: Removed 121 assume(true) statements. [2020-11-28 02:57:11,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:11 BoogieIcfgContainer [2020-11-28 02:57:11,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:57:11,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 02:57:11,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 02:57:11,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 02:57:11,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:57:09" (1/3) ... [2020-11-28 02:57:11,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3113d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:57:11, skipping insertion in model container [2020-11-28 02:57:11,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:57:09" (2/3) ... [2020-11-28 02:57:11,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3113d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:57:11, skipping insertion in model container [2020-11-28 02:57:11,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:11" (3/3) ... [2020-11-28 02:57:11,080 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2020-11-28 02:57:11,096 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 02:57:11,101 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 02:57:11,110 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-28 02:57:11,136 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 02:57:11,137 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 02:57:11,137 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 02:57:11,137 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:57:11,137 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:57:11,137 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 02:57:11,137 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:57:11,137 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 02:57:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states. [2020-11-28 02:57:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:11,168 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:11,169 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] [2020-11-28 02:57:11,169 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:11,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1838342379, now seen corresponding path program 1 times [2020-11-28 02:57:11,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:11,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346607779] [2020-11-28 02:57:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:11,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346607779] [2020-11-28 02:57:11,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:11,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:57:11,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644654073] [2020-11-28 02:57:11,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:11,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:11,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:11,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:11,435 INFO L87 Difference]: Start difference. First operand 277 states. Second operand 3 states. [2020-11-28 02:57:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:11,514 INFO L93 Difference]: Finished difference Result 548 states and 858 transitions. [2020-11-28 02:57:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:11,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-28 02:57:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:11,531 INFO L225 Difference]: With dead ends: 548 [2020-11-28 02:57:11,531 INFO L226 Difference]: Without dead ends: 272 [2020-11-28 02:57:11,536 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-11-28 02:57:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-11-28 02:57:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2020-11-28 02:57:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-11-28 02:57:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 412 transitions. [2020-11-28 02:57:11,607 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 412 transitions. Word has length 61 [2020-11-28 02:57:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:11,607 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 412 transitions. [2020-11-28 02:57:11,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 412 transitions. [2020-11-28 02:57:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:11,611 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:11,611 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] [2020-11-28 02:57:11,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 02:57:11,612 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:11,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:11,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1195707667, now seen corresponding path program 1 times [2020-11-28 02:57:11,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:11,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423210393] [2020-11-28 02:57:11,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:11,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423210393] [2020-11-28 02:57:11,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:11,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:11,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194123155] [2020-11-28 02:57:11,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:11,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:11,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:11,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:11,687 INFO L87 Difference]: Start difference. First operand 272 states and 412 transitions. Second operand 3 states. [2020-11-28 02:57:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:11,796 INFO L93 Difference]: Finished difference Result 730 states and 1104 transitions. [2020-11-28 02:57:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:11,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-28 02:57:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:11,800 INFO L225 Difference]: With dead ends: 730 [2020-11-28 02:57:11,801 INFO L226 Difference]: Without dead ends: 466 [2020-11-28 02:57:11,803 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-11-28 02:57:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-11-28 02:57:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2020-11-28 02:57:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-28 02:57:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 694 transitions. [2020-11-28 02:57:11,858 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 694 transitions. Word has length 61 [2020-11-28 02:57:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:11,859 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 694 transitions. [2020-11-28 02:57:11,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 694 transitions. [2020-11-28 02:57:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:11,863 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:11,864 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] [2020-11-28 02:57:11,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 02:57:11,865 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash 266288339, now seen corresponding path program 1 times [2020-11-28 02:57:11,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:11,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306607516] [2020-11-28 02:57:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:11,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306607516] [2020-11-28 02:57:11,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:11,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:11,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881796548] [2020-11-28 02:57:11,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:11,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:11,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:11,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:11,984 INFO L87 Difference]: Start difference. First operand 464 states and 694 transitions. Second operand 3 states. [2020-11-28 02:57:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:12,055 INFO L93 Difference]: Finished difference Result 919 states and 1375 transitions. [2020-11-28 02:57:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:12,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-28 02:57:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:12,062 INFO L225 Difference]: With dead ends: 919 [2020-11-28 02:57:12,062 INFO L226 Difference]: Without dead ends: 464 [2020-11-28 02:57:12,063 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-11-28 02:57:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-28 02:57:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-28 02:57:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-28 02:57:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 686 transitions. [2020-11-28 02:57:12,128 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 686 transitions. Word has length 61 [2020-11-28 02:57:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:12,129 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 686 transitions. [2020-11-28 02:57:12,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 686 transitions. [2020-11-28 02:57:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:12,135 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:12,140 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] [2020-11-28 02:57:12,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 02:57:12,140 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:12,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:12,141 INFO L82 PathProgramCache]: Analyzing trace with hash 710189013, now seen corresponding path program 1 times [2020-11-28 02:57:12,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:12,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325676686] [2020-11-28 02:57:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:12,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325676686] [2020-11-28 02:57:12,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:12,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:12,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841968912] [2020-11-28 02:57:12,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:12,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:12,233 INFO L87 Difference]: Start difference. First operand 464 states and 686 transitions. Second operand 3 states. [2020-11-28 02:57:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:12,270 INFO L93 Difference]: Finished difference Result 918 states and 1358 transitions. [2020-11-28 02:57:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:12,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-28 02:57:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:12,274 INFO L225 Difference]: With dead ends: 918 [2020-11-28 02:57:12,274 INFO L226 Difference]: Without dead ends: 464 [2020-11-28 02:57:12,275 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-11-28 02:57:12,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-28 02:57:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-28 02:57:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-28 02:57:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 678 transitions. [2020-11-28 02:57:12,299 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 678 transitions. Word has length 61 [2020-11-28 02:57:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:12,299 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 678 transitions. [2020-11-28 02:57:12,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 678 transitions. [2020-11-28 02:57:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:12,301 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:12,301 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] [2020-11-28 02:57:12,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 02:57:12,301 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1623736427, now seen corresponding path program 1 times [2020-11-28 02:57:12,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:12,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481893276] [2020-11-28 02:57:12,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:12,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481893276] [2020-11-28 02:57:12,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:12,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:12,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907552247] [2020-11-28 02:57:12,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:12,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:12,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:12,409 INFO L87 Difference]: Start difference. First operand 464 states and 678 transitions. Second operand 3 states. [2020-11-28 02:57:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:12,449 INFO L93 Difference]: Finished difference Result 917 states and 1341 transitions. [2020-11-28 02:57:12,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:12,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-28 02:57:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:12,453 INFO L225 Difference]: With dead ends: 917 [2020-11-28 02:57:12,453 INFO L226 Difference]: Without dead ends: 464 [2020-11-28 02:57:12,455 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-11-28 02:57:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-28 02:57:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-28 02:57:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-28 02:57:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 670 transitions. [2020-11-28 02:57:12,480 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 670 transitions. Word has length 61 [2020-11-28 02:57:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:12,481 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 670 transitions. [2020-11-28 02:57:12,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 670 transitions. [2020-11-28 02:57:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:12,482 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:12,483 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] [2020-11-28 02:57:12,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 02:57:12,483 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash -175003691, now seen corresponding path program 1 times [2020-11-28 02:57:12,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:12,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370258188] [2020-11-28 02:57:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:12,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370258188] [2020-11-28 02:57:12,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:12,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:12,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911588265] [2020-11-28 02:57:12,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:12,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:12,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:12,567 INFO L87 Difference]: Start difference. First operand 464 states and 670 transitions. Second operand 3 states. [2020-11-28 02:57:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:12,637 INFO L93 Difference]: Finished difference Result 916 states and 1324 transitions. [2020-11-28 02:57:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:12,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-28 02:57:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:12,641 INFO L225 Difference]: With dead ends: 916 [2020-11-28 02:57:12,642 INFO L226 Difference]: Without dead ends: 464 [2020-11-28 02:57:12,643 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-11-28 02:57:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-28 02:57:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-28 02:57:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-28 02:57:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 654 transitions. [2020-11-28 02:57:12,692 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 654 transitions. Word has length 61 [2020-11-28 02:57:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:12,696 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 654 transitions. [2020-11-28 02:57:12,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 654 transitions. [2020-11-28 02:57:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:12,698 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:12,699 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] [2020-11-28 02:57:12,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 02:57:12,700 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:12,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1945036492, now seen corresponding path program 1 times [2020-11-28 02:57:12,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:12,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892343125] [2020-11-28 02:57:12,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:12,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892343125] [2020-11-28 02:57:12,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:12,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:12,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649146539] [2020-11-28 02:57:12,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:12,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:12,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:12,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:12,783 INFO L87 Difference]: Start difference. First operand 464 states and 654 transitions. Second operand 3 states. [2020-11-28 02:57:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:12,848 INFO L93 Difference]: Finished difference Result 914 states and 1289 transitions. [2020-11-28 02:57:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:12,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-28 02:57:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:12,852 INFO L225 Difference]: With dead ends: 914 [2020-11-28 02:57:12,853 INFO L226 Difference]: Without dead ends: 464 [2020-11-28 02:57:12,854 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-11-28 02:57:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-28 02:57:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-11-28 02:57:12,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-11-28 02:57:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 638 transitions. [2020-11-28 02:57:12,883 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 638 transitions. Word has length 61 [2020-11-28 02:57:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:12,883 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 638 transitions. [2020-11-28 02:57:12,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 638 transitions. [2020-11-28 02:57:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:12,885 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:12,885 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] [2020-11-28 02:57:12,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 02:57:12,885 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:12,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1902661357, now seen corresponding path program 1 times [2020-11-28 02:57:12,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:12,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927516710] [2020-11-28 02:57:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:12,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927516710] [2020-11-28 02:57:12,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:12,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:57:12,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627809671] [2020-11-28 02:57:12,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:57:12,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:12,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:57:12,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:57:12,972 INFO L87 Difference]: Start difference. First operand 464 states and 638 transitions. Second operand 5 states. [2020-11-28 02:57:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:13,172 INFO L93 Difference]: Finished difference Result 1468 states and 2029 transitions. [2020-11-28 02:57:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:57:13,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-11-28 02:57:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:13,179 INFO L225 Difference]: With dead ends: 1468 [2020-11-28 02:57:13,179 INFO L226 Difference]: Without dead ends: 1025 [2020-11-28 02:57:13,180 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-11-28 02:57:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2020-11-28 02:57:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 479. [2020-11-28 02:57:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-11-28 02:57:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 648 transitions. [2020-11-28 02:57:13,216 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 648 transitions. Word has length 61 [2020-11-28 02:57:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:13,217 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 648 transitions. [2020-11-28 02:57:13,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:57:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 648 transitions. [2020-11-28 02:57:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:13,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:13,218 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] [2020-11-28 02:57:13,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 02:57:13,218 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:13,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:13,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1654514863, now seen corresponding path program 1 times [2020-11-28 02:57:13,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:13,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957860766] [2020-11-28 02:57:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:13,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957860766] [2020-11-28 02:57:13,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:13,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:57:13,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942285631] [2020-11-28 02:57:13,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:57:13,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:57:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:57:13,298 INFO L87 Difference]: Start difference. First operand 479 states and 648 transitions. Second operand 5 states. [2020-11-28 02:57:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:13,465 INFO L93 Difference]: Finished difference Result 1256 states and 1713 transitions. [2020-11-28 02:57:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:57:13,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-11-28 02:57:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:13,471 INFO L225 Difference]: With dead ends: 1256 [2020-11-28 02:57:13,471 INFO L226 Difference]: Without dead ends: 805 [2020-11-28 02:57:13,472 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-11-28 02:57:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-11-28 02:57:13,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 485. [2020-11-28 02:57:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-11-28 02:57:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 646 transitions. [2020-11-28 02:57:13,535 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 646 transitions. Word has length 61 [2020-11-28 02:57:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:13,535 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 646 transitions. [2020-11-28 02:57:13,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:57:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 646 transitions. [2020-11-28 02:57:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:13,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:13,536 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] [2020-11-28 02:57:13,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 02:57:13,537 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:13,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2048881649, now seen corresponding path program 1 times [2020-11-28 02:57:13,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:13,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180389522] [2020-11-28 02:57:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:13,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180389522] [2020-11-28 02:57:13,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:13,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:57:13,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319609017] [2020-11-28 02:57:13,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:57:13,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:13,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:57:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:57:13,600 INFO L87 Difference]: Start difference. First operand 485 states and 646 transitions. Second operand 5 states. [2020-11-28 02:57:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:13,843 INFO L93 Difference]: Finished difference Result 1610 states and 2151 transitions. [2020-11-28 02:57:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:57:13,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-11-28 02:57:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:13,850 INFO L225 Difference]: With dead ends: 1610 [2020-11-28 02:57:13,850 INFO L226 Difference]: Without dead ends: 1160 [2020-11-28 02:57:13,852 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-11-28 02:57:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-11-28 02:57:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 515. [2020-11-28 02:57:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-11-28 02:57:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 676 transitions. [2020-11-28 02:57:13,904 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 676 transitions. Word has length 61 [2020-11-28 02:57:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:13,904 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 676 transitions. [2020-11-28 02:57:13,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:57:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 676 transitions. [2020-11-28 02:57:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:13,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:13,906 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] [2020-11-28 02:57:13,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 02:57:13,906 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:13,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:13,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2026249395, now seen corresponding path program 1 times [2020-11-28 02:57:13,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:13,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443446749] [2020-11-28 02:57:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:13,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443446749] [2020-11-28 02:57:13,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:13,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:57:13,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780357175] [2020-11-28 02:57:13,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:57:13,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:13,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:57:13,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:57:13,983 INFO L87 Difference]: Start difference. First operand 515 states and 676 transitions. Second operand 5 states. [2020-11-28 02:57:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:14,157 INFO L93 Difference]: Finished difference Result 1397 states and 1850 transitions. [2020-11-28 02:57:14,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:57:14,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-11-28 02:57:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:14,166 INFO L225 Difference]: With dead ends: 1397 [2020-11-28 02:57:14,166 INFO L226 Difference]: Without dead ends: 927 [2020-11-28 02:57:14,167 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-11-28 02:57:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-11-28 02:57:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 521. [2020-11-28 02:57:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-11-28 02:57:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 674 transitions. [2020-11-28 02:57:14,216 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 674 transitions. Word has length 61 [2020-11-28 02:57:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:14,217 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 674 transitions. [2020-11-28 02:57:14,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:57:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 674 transitions. [2020-11-28 02:57:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:14,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:14,218 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] [2020-11-28 02:57:14,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 02:57:14,219 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2134704395, now seen corresponding path program 1 times [2020-11-28 02:57:14,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:14,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075798703] [2020-11-28 02:57:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:14,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075798703] [2020-11-28 02:57:14,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:14,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:14,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10146933] [2020-11-28 02:57:14,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:14,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:14,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:14,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:14,275 INFO L87 Difference]: Start difference. First operand 521 states and 674 transitions. Second operand 3 states. [2020-11-28 02:57:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:14,346 INFO L93 Difference]: Finished difference Result 1005 states and 1299 transitions. [2020-11-28 02:57:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:14,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-28 02:57:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:14,350 INFO L225 Difference]: With dead ends: 1005 [2020-11-28 02:57:14,350 INFO L226 Difference]: Without dead ends: 497 [2020-11-28 02:57:14,354 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-11-28 02:57:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-11-28 02:57:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2020-11-28 02:57:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-11-28 02:57:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 626 transitions. [2020-11-28 02:57:14,422 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 626 transitions. Word has length 61 [2020-11-28 02:57:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:14,422 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 626 transitions. [2020-11-28 02:57:14,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 626 transitions. [2020-11-28 02:57:14,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-28 02:57:14,423 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:14,423 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] [2020-11-28 02:57:14,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 02:57:14,424 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:14,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:14,425 INFO L82 PathProgramCache]: Analyzing trace with hash 140559689, now seen corresponding path program 1 times [2020-11-28 02:57:14,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:14,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710819913] [2020-11-28 02:57:14,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:14,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710819913] [2020-11-28 02:57:14,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:14,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:57:14,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678784317] [2020-11-28 02:57:14,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:14,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:14,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:14,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:14,479 INFO L87 Difference]: Start difference. First operand 497 states and 626 transitions. Second operand 3 states. [2020-11-28 02:57:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:14,587 INFO L93 Difference]: Finished difference Result 1368 states and 1714 transitions. [2020-11-28 02:57:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:14,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-11-28 02:57:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:14,594 INFO L225 Difference]: With dead ends: 1368 [2020-11-28 02:57:14,594 INFO L226 Difference]: Without dead ends: 920 [2020-11-28 02:57:14,595 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-11-28 02:57:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2020-11-28 02:57:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 891. [2020-11-28 02:57:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2020-11-28 02:57:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1103 transitions. [2020-11-28 02:57:14,669 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1103 transitions. Word has length 61 [2020-11-28 02:57:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:14,670 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1103 transitions. [2020-11-28 02:57:14,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1103 transitions. [2020-11-28 02:57:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-28 02:57:14,672 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:14,672 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] [2020-11-28 02:57:14,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 02:57:14,672 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:14,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:14,673 INFO L82 PathProgramCache]: Analyzing trace with hash 327530686, now seen corresponding path program 1 times [2020-11-28 02:57:14,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:14,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114107639] [2020-11-28 02:57:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:14,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114107639] [2020-11-28 02:57:14,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:14,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:57:14,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094141143] [2020-11-28 02:57:14,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:14,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:14,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:14,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:14,752 INFO L87 Difference]: Start difference. First operand 891 states and 1103 transitions. Second operand 3 states. [2020-11-28 02:57:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:14,904 INFO L93 Difference]: Finished difference Result 2319 states and 2877 transitions. [2020-11-28 02:57:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:14,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-11-28 02:57:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:14,913 INFO L225 Difference]: With dead ends: 2319 [2020-11-28 02:57:14,913 INFO L226 Difference]: Without dead ends: 1522 [2020-11-28 02:57:14,916 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-11-28 02:57:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2020-11-28 02:57:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1520. [2020-11-28 02:57:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2020-11-28 02:57:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1870 transitions. [2020-11-28 02:57:15,068 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1870 transitions. Word has length 62 [2020-11-28 02:57:15,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:15,068 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 1870 transitions. [2020-11-28 02:57:15,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1870 transitions. [2020-11-28 02:57:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 02:57:15,070 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:15,070 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] [2020-11-28 02:57:15,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 02:57:15,071 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:15,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash -479572275, now seen corresponding path program 1 times [2020-11-28 02:57:15,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:15,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933259390] [2020-11-28 02:57:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:15,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-11-28 02:57:15,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933259390] [2020-11-28 02:57:15,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:15,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:57:15,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927581265] [2020-11-28 02:57:15,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:15,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:15,119 INFO L87 Difference]: Start difference. First operand 1520 states and 1870 transitions. Second operand 3 states. [2020-11-28 02:57:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:15,361 INFO L93 Difference]: Finished difference Result 4144 states and 5092 transitions. [2020-11-28 02:57:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:15,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-11-28 02:57:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:15,390 INFO L225 Difference]: With dead ends: 4144 [2020-11-28 02:57:15,391 INFO L226 Difference]: Without dead ends: 2718 [2020-11-28 02:57:15,395 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-11-28 02:57:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2020-11-28 02:57:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2716. [2020-11-28 02:57:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2020-11-28 02:57:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3314 transitions. [2020-11-28 02:57:15,599 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3314 transitions. Word has length 63 [2020-11-28 02:57:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:15,600 INFO L481 AbstractCegarLoop]: Abstraction has 2716 states and 3314 transitions. [2020-11-28 02:57:15,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3314 transitions. [2020-11-28 02:57:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 02:57:15,601 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:15,602 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] [2020-11-28 02:57:15,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 02:57:15,602 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash -45843189, now seen corresponding path program 1 times [2020-11-28 02:57:15,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:15,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290950784] [2020-11-28 02:57:15,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:15,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290950784] [2020-11-28 02:57:15,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:15,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:57:15,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532646690] [2020-11-28 02:57:15,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:15,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:15,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:15,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:15,632 INFO L87 Difference]: Start difference. First operand 2716 states and 3314 transitions. Second operand 3 states. [2020-11-28 02:57:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:15,835 INFO L93 Difference]: Finished difference Result 5252 states and 6425 transitions. [2020-11-28 02:57:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:15,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-11-28 02:57:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:15,849 INFO L225 Difference]: With dead ends: 5252 [2020-11-28 02:57:15,849 INFO L226 Difference]: Without dead ends: 2630 [2020-11-28 02:57:15,853 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-11-28 02:57:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2020-11-28 02:57:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630. [2020-11-28 02:57:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2020-11-28 02:57:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3216 transitions. [2020-11-28 02:57:16,071 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3216 transitions. Word has length 63 [2020-11-28 02:57:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:16,071 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 3216 transitions. [2020-11-28 02:57:16,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3216 transitions. [2020-11-28 02:57:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-28 02:57:16,072 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:16,072 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] [2020-11-28 02:57:16,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 02:57:16,073 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:16,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash -709022745, now seen corresponding path program 1 times [2020-11-28 02:57:16,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:16,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714086108] [2020-11-28 02:57:16,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:16,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714086108] [2020-11-28 02:57:16,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:16,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:16,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098094768] [2020-11-28 02:57:16,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:16,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:16,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:16,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:16,127 INFO L87 Difference]: Start difference. First operand 2630 states and 3216 transitions. Second operand 3 states. [2020-11-28 02:57:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:16,559 INFO L93 Difference]: Finished difference Result 7634 states and 9339 transitions. [2020-11-28 02:57:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:16,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-28 02:57:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:16,584 INFO L225 Difference]: With dead ends: 7634 [2020-11-28 02:57:16,584 INFO L226 Difference]: Without dead ends: 5074 [2020-11-28 02:57:16,588 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-11-28 02:57:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2020-11-28 02:57:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5042. [2020-11-28 02:57:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2020-11-28 02:57:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 6106 transitions. [2020-11-28 02:57:17,012 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 6106 transitions. Word has length 64 [2020-11-28 02:57:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:17,013 INFO L481 AbstractCegarLoop]: Abstraction has 5042 states and 6106 transitions. [2020-11-28 02:57:17,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 6106 transitions. [2020-11-28 02:57:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-28 02:57:17,016 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:17,016 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 02:57:17,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 02:57:17,016 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:17,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1717276157, now seen corresponding path program 1 times [2020-11-28 02:57:17,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:17,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524818564] [2020-11-28 02:57:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:17,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524818564] [2020-11-28 02:57:17,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:17,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:57:17,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056096222] [2020-11-28 02:57:17,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:57:17,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:17,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:57:17,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:57:17,066 INFO L87 Difference]: Start difference. First operand 5042 states and 6106 transitions. Second operand 4 states. [2020-11-28 02:57:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:17,926 INFO L93 Difference]: Finished difference Result 14910 states and 18027 transitions. [2020-11-28 02:57:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:57:17,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-11-28 02:57:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:17,985 INFO L225 Difference]: With dead ends: 14910 [2020-11-28 02:57:17,985 INFO L226 Difference]: Without dead ends: 7496 [2020-11-28 02:57:17,995 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-11-28 02:57:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7496 states. [2020-11-28 02:57:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7496 to 7496. [2020-11-28 02:57:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7496 states. [2020-11-28 02:57:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 9042 transitions. [2020-11-28 02:57:18,618 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 9042 transitions. Word has length 81 [2020-11-28 02:57:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:18,618 INFO L481 AbstractCegarLoop]: Abstraction has 7496 states and 9042 transitions. [2020-11-28 02:57:18,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:57:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 9042 transitions. [2020-11-28 02:57:18,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-11-28 02:57:18,624 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:18,624 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 02:57:18,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 02:57:18,625 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:18,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:18,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1115959489, now seen corresponding path program 1 times [2020-11-28 02:57:18,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:18,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204085230] [2020-11-28 02:57:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-28 02:57:18,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204085230] [2020-11-28 02:57:18,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:18,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:18,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637705990] [2020-11-28 02:57:18,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:18,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:18,685 INFO L87 Difference]: Start difference. First operand 7496 states and 9042 transitions. Second operand 3 states. [2020-11-28 02:57:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:19,361 INFO L93 Difference]: Finished difference Result 17102 states and 20603 transitions. [2020-11-28 02:57:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:19,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2020-11-28 02:57:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:19,380 INFO L225 Difference]: With dead ends: 17102 [2020-11-28 02:57:19,381 INFO L226 Difference]: Without dead ends: 9662 [2020-11-28 02:57:19,389 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-11-28 02:57:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9662 states. [2020-11-28 02:57:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9662 to 9614. [2020-11-28 02:57:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2020-11-28 02:57:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 11518 transitions. [2020-11-28 02:57:19,902 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 11518 transitions. Word has length 110 [2020-11-28 02:57:19,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:19,902 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 11518 transitions. [2020-11-28 02:57:19,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:19,902 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 11518 transitions. [2020-11-28 02:57:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-28 02:57:19,909 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:19,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:57:19,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 02:57:19,910 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 577449217, now seen corresponding path program 1 times [2020-11-28 02:57:19,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:19,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235352779] [2020-11-28 02:57:19,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:19,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235352779] [2020-11-28 02:57:19,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:19,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:57:19,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874248791] [2020-11-28 02:57:19,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:57:19,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:57:19,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:57:19,961 INFO L87 Difference]: Start difference. First operand 9614 states and 11518 transitions. Second operand 4 states. [2020-11-28 02:57:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:20,847 INFO L93 Difference]: Finished difference Result 17020 states and 20462 transitions. [2020-11-28 02:57:20,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:57:20,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2020-11-28 02:57:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:20,868 INFO L225 Difference]: With dead ends: 17020 [2020-11-28 02:57:20,868 INFO L226 Difference]: Without dead ends: 9616 [2020-11-28 02:57:20,879 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-11-28 02:57:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9616 states. [2020-11-28 02:57:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9616 to 9614. [2020-11-28 02:57:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2020-11-28 02:57:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 11476 transitions. [2020-11-28 02:57:21,452 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 11476 transitions. Word has length 113 [2020-11-28 02:57:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:21,452 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 11476 transitions. [2020-11-28 02:57:21,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:57:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 11476 transitions. [2020-11-28 02:57:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-11-28 02:57:21,460 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:21,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:57:21,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 02:57:21,461 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:21,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:21,461 INFO L82 PathProgramCache]: Analyzing trace with hash 163247736, now seen corresponding path program 1 times [2020-11-28 02:57:21,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:21,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799780616] [2020-11-28 02:57:21,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-28 02:57:21,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799780616] [2020-11-28 02:57:21,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:21,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 02:57:21,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989837069] [2020-11-28 02:57:21,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:21,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:21,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:21,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:21,527 INFO L87 Difference]: Start difference. First operand 9614 states and 11476 transitions. Second operand 3 states. [2020-11-28 02:57:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:22,394 INFO L93 Difference]: Finished difference Result 21076 states and 25107 transitions. [2020-11-28 02:57:22,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:22,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-11-28 02:57:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:22,416 INFO L225 Difference]: With dead ends: 21076 [2020-11-28 02:57:22,416 INFO L226 Difference]: Without dead ends: 11504 [2020-11-28 02:57:22,426 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-11-28 02:57:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11504 states. [2020-11-28 02:57:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11504 to 11440. [2020-11-28 02:57:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-11-28 02:57:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13564 transitions. [2020-11-28 02:57:22,969 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13564 transitions. Word has length 142 [2020-11-28 02:57:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:22,970 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13564 transitions. [2020-11-28 02:57:22,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13564 transitions. [2020-11-28 02:57:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-28 02:57:22,979 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:22,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:57:22,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-28 02:57:22,980 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:22,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1331585155, now seen corresponding path program 1 times [2020-11-28 02:57:22,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:22,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962423323] [2020-11-28 02:57:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:23,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962423323] [2020-11-28 02:57:23,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:23,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:57:23,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931650934] [2020-11-28 02:57:23,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:57:23,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:57:23,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:57:23,116 INFO L87 Difference]: Start difference. First operand 11440 states and 13564 transitions. Second operand 4 states. [2020-11-28 02:57:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:23,742 INFO L93 Difference]: Finished difference Result 20966 states and 24946 transitions. [2020-11-28 02:57:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:57:23,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-11-28 02:57:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:23,764 INFO L225 Difference]: With dead ends: 20966 [2020-11-28 02:57:23,764 INFO L226 Difference]: Without dead ends: 11442 [2020-11-28 02:57:23,776 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-11-28 02:57:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2020-11-28 02:57:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11440. [2020-11-28 02:57:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-11-28 02:57:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13484 transitions. [2020-11-28 02:57:24,570 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13484 transitions. Word has length 145 [2020-11-28 02:57:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:24,570 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13484 transitions. [2020-11-28 02:57:24,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:57:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13484 transitions. [2020-11-28 02:57:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-11-28 02:57:24,580 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:24,581 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, 1, 1, 1, 1, 1] [2020-11-28 02:57:24,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-28 02:57:24,581 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1031093230, now seen corresponding path program 1 times [2020-11-28 02:57:24,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:24,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297854682] [2020-11-28 02:57:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:24,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297854682] [2020-11-28 02:57:24,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:24,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:57:24,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771505706] [2020-11-28 02:57:24,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:24,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:24,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:24,676 INFO L87 Difference]: Start difference. First operand 11440 states and 13484 transitions. Second operand 3 states. [2020-11-28 02:57:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:25,373 INFO L93 Difference]: Finished difference Result 19782 states and 23399 transitions. [2020-11-28 02:57:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:25,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-11-28 02:57:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:25,387 INFO L225 Difference]: With dead ends: 19782 [2020-11-28 02:57:25,387 INFO L226 Difference]: Without dead ends: 11472 [2020-11-28 02:57:25,397 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-11-28 02:57:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2020-11-28 02:57:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 11440. [2020-11-28 02:57:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-11-28 02:57:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13276 transitions. [2020-11-28 02:57:26,047 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13276 transitions. Word has length 174 [2020-11-28 02:57:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:26,047 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13276 transitions. [2020-11-28 02:57:26,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13276 transitions. [2020-11-28 02:57:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-11-28 02:57:26,055 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:26,055 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, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:57:26,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-28 02:57:26,056 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:26,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:26,056 INFO L82 PathProgramCache]: Analyzing trace with hash 807546521, now seen corresponding path program 1 times [2020-11-28 02:57:26,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:26,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498706572] [2020-11-28 02:57:26,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:26,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498706572] [2020-11-28 02:57:26,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:26,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:57:26,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409501805] [2020-11-28 02:57:26,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:26,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:26,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:26,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:26,125 INFO L87 Difference]: Start difference. First operand 11440 states and 13276 transitions. Second operand 3 states. [2020-11-28 02:57:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:26,924 INFO L93 Difference]: Finished difference Result 18390 states and 21415 transitions. [2020-11-28 02:57:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:26,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-11-28 02:57:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:26,938 INFO L225 Difference]: With dead ends: 18390 [2020-11-28 02:57:26,939 INFO L226 Difference]: Without dead ends: 11440 [2020-11-28 02:57:26,945 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-11-28 02:57:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11440 states. [2020-11-28 02:57:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11440 to 11410. [2020-11-28 02:57:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11410 states. [2020-11-28 02:57:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11410 states to 11410 states and 13082 transitions. [2020-11-28 02:57:27,729 INFO L78 Accepts]: Start accepts. Automaton has 11410 states and 13082 transitions. Word has length 176 [2020-11-28 02:57:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:27,729 INFO L481 AbstractCegarLoop]: Abstraction has 11410 states and 13082 transitions. [2020-11-28 02:57:27,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 11410 states and 13082 transitions. [2020-11-28 02:57:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-11-28 02:57:27,738 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:27,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:57:27,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-28 02:57:27,739 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:27,739 INFO L82 PathProgramCache]: Analyzing trace with hash 251088387, now seen corresponding path program 1 times [2020-11-28 02:57:27,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:27,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210628418] [2020-11-28 02:57:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 02:57:27,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210628418] [2020-11-28 02:57:27,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:27,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:57:27,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145757834] [2020-11-28 02:57:27,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:27,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:27,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:27,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:27,802 INFO L87 Difference]: Start difference. First operand 11410 states and 13082 transitions. Second operand 3 states. [2020-11-28 02:57:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:28,444 INFO L93 Difference]: Finished difference Result 22664 states and 25781 transitions. [2020-11-28 02:57:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:28,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-11-28 02:57:28,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:28,452 INFO L225 Difference]: With dead ends: 22664 [2020-11-28 02:57:28,452 INFO L226 Difference]: Without dead ends: 6788 [2020-11-28 02:57:28,461 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-11-28 02:57:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6788 states. [2020-11-28 02:57:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6788 to 6580. [2020-11-28 02:57:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6580 states. [2020-11-28 02:57:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7246 transitions. [2020-11-28 02:57:28,878 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7246 transitions. Word has length 178 [2020-11-28 02:57:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:28,879 INFO L481 AbstractCegarLoop]: Abstraction has 6580 states and 7246 transitions. [2020-11-28 02:57:28,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7246 transitions. [2020-11-28 02:57:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-28 02:57:28,885 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:28,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:57:28,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-28 02:57:28,886 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:28,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash -32931800, now seen corresponding path program 1 times [2020-11-28 02:57:28,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:28,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655605768] [2020-11-28 02:57:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:57:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:57:29,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655605768] [2020-11-28 02:57:29,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:57:29,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:57:29,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942408244] [2020-11-28 02:57:29,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:57:29,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:57:29,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:57:29,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:57:29,021 INFO L87 Difference]: Start difference. First operand 6580 states and 7246 transitions. Second operand 3 states. [2020-11-28 02:57:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:57:29,468 INFO L93 Difference]: Finished difference Result 11554 states and 12749 transitions. [2020-11-28 02:57:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:57:29,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-11-28 02:57:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:57:29,475 INFO L225 Difference]: With dead ends: 11554 [2020-11-28 02:57:29,475 INFO L226 Difference]: Without dead ends: 6580 [2020-11-28 02:57:29,479 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-11-28 02:57:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2020-11-28 02:57:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6580. [2020-11-28 02:57:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6580 states. [2020-11-28 02:57:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7168 transitions. [2020-11-28 02:57:29,843 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7168 transitions. Word has length 180 [2020-11-28 02:57:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:57:29,843 INFO L481 AbstractCegarLoop]: Abstraction has 6580 states and 7168 transitions. [2020-11-28 02:57:29,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:57:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7168 transitions. [2020-11-28 02:57:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-11-28 02:57:29,849 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:57:29,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:57:29,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-28 02:57:29,849 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:57:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:57:29,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1382104249, now seen corresponding path program 1 times [2020-11-28 02:57:29,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:57:29,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024669851] [2020-11-28 02:57:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:57:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:57:29,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:57:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:57:29,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:57:29,970 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:57:29,970 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 02:57:29,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-28 02:57:30,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:57:30 BoogieIcfgContainer [2020-11-28 02:57:30,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 02:57:30,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:57:30,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:57:30,148 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:57:30,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:57:11" (3/4) ... [2020-11-28 02:57:30,152 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 02:57:30,338 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00dd55ff-1e2a-4cbf-b492-732ef0a03cf6/bin/uautomizer/witness.graphml [2020-11-28 02:57:30,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:57:30,341 INFO L168 Benchmark]: Toolchain (without parser) took 21219.03 ms. Allocated memory was 115.3 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 91.1 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 743.0 MB. Max. memory is 16.1 GB. [2020-11-28 02:57:30,341 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 81.8 MB. Free memory is still 45.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:57:30,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.72 ms. Allocated memory is still 115.3 MB. Free memory was 90.8 MB in the beginning and 88.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 02:57:30,342 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.50 ms. Allocated memory is still 115.3 MB. Free memory was 88.1 MB in the beginning and 84.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 02:57:30,342 INFO L168 Benchmark]: Boogie Preprocessor took 103.85 ms. Allocated memory is still 115.3 MB. Free memory was 84.3 MB in the beginning and 81.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:57:30,343 INFO L168 Benchmark]: RCFGBuilder took 1268.85 ms. Allocated memory is still 115.3 MB. Free memory was 81.6 MB in the beginning and 55.4 MB in the end (delta: 26.2 MB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:57:30,343 INFO L168 Benchmark]: TraceAbstraction took 19079.75 ms. Allocated memory was 115.3 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 54.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 678.2 MB. Max. memory is 16.1 GB. [2020-11-28 02:57:30,343 INFO L168 Benchmark]: Witness Printer took 191.17 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 28.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-28 02:57:30,346 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.26 ms. Allocated memory is still 81.8 MB. Free memory is still 45.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 435.72 ms. Allocated memory is still 115.3 MB. Free memory was 90.8 MB in the beginning and 88.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 133.50 ms. Allocated memory is still 115.3 MB. Free memory was 88.1 MB in the beginning and 84.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 103.85 ms. Allocated memory is still 115.3 MB. Free memory was 84.3 MB in the beginning and 81.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1268.85 ms. Allocated memory is still 115.3 MB. Free memory was 81.6 MB in the beginning and 55.4 MB in the end (delta: 26.2 MB). Peak memory consumption was 35.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19079.75 ms. Allocated memory was 115.3 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 54.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 678.2 MB. Max. memory is 16.1 GB. * Witness Printer took 191.17 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 28.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 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 m_st ; [L22] int t1_st ; [L23] int t2_st ; [L24] int t3_st ; [L25] int m_i ; [L26] int t1_i ; [L27] int t2_i ; [L28] int t3_i ; [L29] int M_E = 2; [L30] int T1_E = 2; [L31] int T2_E = 2; [L32] int T3_E = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; VAL [E_1=2, E_2=2, E_3=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] [L689] int __retres1 ; [L602] m_i = 1 [L603] t1_i = 1 [L604] t2_i = 1 [L605] t3_i = 1 VAL [E_1=2, E_2=2, E_3=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] [L630] int kernel_st ; [L631] int tmp ; [L632] int tmp___0 ; [L636] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=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] [L273] COND TRUE m_i == 1 [L274] m_st = 0 VAL [E_1=2, E_2=2, E_3=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] [L278] COND TRUE t1_i == 1 [L279] t1_st = 0 VAL [E_1=2, E_2=2, E_3=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] [L283] COND TRUE t2_i == 1 [L284] t2_st = 0 VAL [E_1=2, E_2=2, E_3=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] [L288] COND TRUE t3_i == 1 [L289] t3_st = 0 VAL [E_1=2, E_2=2, E_3=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] [L410] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=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] [L415] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=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] [L420] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=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] [L425] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=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] [L430] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=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] [L435] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=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] [L440] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=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] [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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] [L189] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=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] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_3=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] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=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] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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] [L208] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=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] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_3=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] [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=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] [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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] [L227] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=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] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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] [L239] return (__retres1); VAL [E_1=2, E_2=2, E_3=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] [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=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] [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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] [L246] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=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] [L256] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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] [L258] return (__retres1); VAL [E_1=2, E_2=2, E_3=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] [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=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] [L453] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=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] [L458] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=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] [L463] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=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] [L468] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=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] [L473] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=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] [L478] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=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] [L483] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=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] [L644] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L647] kernel_st = 1 [L329] int tmp ; VAL [E_1=2, E_2=2, E_3=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] [L333] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L298] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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] [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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] [L324] return (__retres1); VAL [E_1=2, E_2=2, E_3=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] [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=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] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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] [L86] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=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] [L97] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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] [L121] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=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] [L132] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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] [L156] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=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] [L167] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L169] t3_pc = 1 [L170] t3_st = 2 VAL [E_1=2, E_2=2, E_3=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] [L333] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L298] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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] [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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] [L324] return (__retres1); VAL [E_1=2, E_2=2, E_3=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] [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND TRUE \read(tmp_ndt_1) [L348] m_st = 1 VAL [E_1=2, E_2=2, E_3=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] [L45] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=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] [L56] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L59] E_1 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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] [L189] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=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] [L199] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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] [L201] return (__retres1); VAL [E_1=1, E_2=2, E_3=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] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=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] [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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] [L208] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=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] [L209] COND TRUE E_1 == 1 [L210] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=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] [L220] return (__retres1); VAL [E_1=1, E_2=2, E_3=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] [L508] tmp___0 = is_transmit1_triggered() [L510] COND TRUE \read(tmp___0) [L511] t1_st = 0 VAL [E_1=1, E_2=2, E_3=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] [L224] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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] [L227] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=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] [L228] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=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] [L237] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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] [L239] return (__retres1); VAL [E_1=1, E_2=2, E_3=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] [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=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] [L243] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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] [L246] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=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] [L247] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=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] [L256] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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] [L258] return (__retres1); VAL [E_1=1, E_2=2, E_3=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] [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=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] [L61] E_1 = 2 VAL [E_1=2, E_2=2, E_3=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] [L64] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L66] m_pc = 1 [L67] m_st = 2 VAL [E_1=2, E_2=2, E_3=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] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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] [L86] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=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] [L89] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=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] [L105] E_2 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=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] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=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] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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] [L201] return (__retres1); VAL [E_1=2, E_2=1, E_3=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] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=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] [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=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] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=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] [L218] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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] [L220] return (__retres1); VAL [E_1=2, E_2=1, E_3=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] [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=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] [L224] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=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] [L228] COND TRUE E_2 == 1 [L229] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=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] [L239] return (__retres1); VAL [E_1=2, E_2=1, E_3=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] [L516] tmp___1 = is_transmit2_triggered() [L518] COND TRUE \read(tmp___1) [L519] t2_st = 0 VAL [E_1=2, E_2=1, E_3=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] [L243] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=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] [L247] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=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] [L256] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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] [L258] return (__retres1); VAL [E_1=2, E_2=1, E_3=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] [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=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] [L107] E_2 = 2 VAL [E_1=2, E_2=2, E_3=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] [L97] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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] [L121] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=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] [L124] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=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] [L140] E_3 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L239] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] COND TRUE E_3 == 1 [L248] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L258] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L524] tmp___2 = is_transmit3_triggered() [L526] COND TRUE \read(tmp___2) [L527] t3_st = 0 VAL [E_1=2, E_2=2, E_3=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=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L142] E_3 = 2 VAL [E_1=2, E_2=2, E_3=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] [L132] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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] [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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] [L156] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=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] [L159] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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] [L3] __assert_fail("0", "transmitter.03.cil.c", 3, "reach_error") VAL [E_1=2, E_2=2, E_3=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 277 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.8s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10958 SDtfs, 11119 SDslu, 8762 SDs, 0 SdLazy, 604 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11440occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 2370 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2526 NumberOfCodeBlocks, 2526 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2318 ConstructedInterpolants, 0 QuantifiedInterpolants, 405898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 171/171 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...