./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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.1.25-9a8b2e8 [2020-10-20 01:53:12,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:53:12,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:53:12,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:53:12,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:53:12,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:53:12,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:53:12,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:53:12,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:53:12,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:53:12,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:53:12,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:53:12,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:53:12,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:53:12,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:53:12,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:53:12,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:53:12,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:53:12,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:53:12,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:53:12,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:53:12,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:53:12,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:53:12,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:53:12,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:53:12,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:53:12,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:53:12,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:53:12,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:53:12,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:53:12,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:53:12,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:53:12,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:53:12,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:53:12,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:53:12,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:53:12,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:53:12,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:53:12,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:53:12,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:53:12,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:53:12,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:53:12,877 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:53:12,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:53:12,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:53:12,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:53:12,882 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:53:12,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:53:12,883 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:53:12,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:53:12,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:53:12,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:53:12,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:53:12,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:53:12,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:53:12,885 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:53:12,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:53:12,886 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:53:12,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:53:12,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:53:12,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:53:12,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:53:12,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:53:12,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:53:12,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:53:12,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:53:12,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:53:12,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:53:12,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:53:12,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:53:12,890 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:53:12,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6768ec4cb10c0d030986cdc2e459713dbcdaadd [2020-10-20 01:53:13,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:53:13,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:53:13,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:53:13,130 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:53:13,131 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:53:13,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-10-20 01:53:13,214 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937495e3e/94111933db024c02ba699ab1e584daf4/FLAGae652ee73 [2020-10-20 01:53:13,746 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:53:13,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-10-20 01:53:13,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937495e3e/94111933db024c02ba699ab1e584daf4/FLAGae652ee73 [2020-10-20 01:53:14,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937495e3e/94111933db024c02ba699ab1e584daf4 [2020-10-20 01:53:14,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:53:14,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:53:14,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:14,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:53:14,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:53:14,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77368ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14, skipping insertion in model container [2020-10-20 01:53:14,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:53:14,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:53:14,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:14,484 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:53:14,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:53:14,561 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:53:14,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14 WrapperNode [2020-10-20 01:53:14,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:53:14,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:14,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:53:14,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:53:14,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:53:14,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:53:14,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:53:14,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:53:14,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... [2020-10-20 01:53:14,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:53:14,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:53:14,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:53:14,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:53:14,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:53:14,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:53:14,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:53:14,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:53:14,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:53:15,829 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:53:15,832 INFO L298 CfgBuilder]: Removed 121 assume(true) statements. [2020-10-20 01:53:15,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:15 BoogieIcfgContainer [2020-10-20 01:53:15,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:53:15,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:53:15,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:53:15,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:53:15,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:53:14" (1/3) ... [2020-10-20 01:53:15,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e77b250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:53:15, skipping insertion in model container [2020-10-20 01:53:15,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:53:14" (2/3) ... [2020-10-20 01:53:15,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e77b250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:53:15, skipping insertion in model container [2020-10-20 01:53:15,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:15" (3/3) ... [2020-10-20 01:53:15,849 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2020-10-20 01:53:15,861 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:53:15,871 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 01:53:15,885 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 01:53:15,927 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:53:15,927 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:53:15,928 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:53:15,930 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:53:15,931 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:53:15,931 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:53:15,931 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:53:15,931 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:53:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states. [2020-10-20 01:53:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:15,978 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:15,980 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-10-20 01:53:15,981 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:15,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:15,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1838342379, now seen corresponding path program 1 times [2020-10-20 01:53:15,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:16,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128403072] [2020-10-20 01:53:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:16,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128403072] [2020-10-20 01:53:16,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:16,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:16,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692900800] [2020-10-20 01:53:16,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:16,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:16,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:16,237 INFO L87 Difference]: Start difference. First operand 277 states. Second operand 3 states. [2020-10-20 01:53:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:16,324 INFO L93 Difference]: Finished difference Result 548 states and 858 transitions. [2020-10-20 01:53:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:16,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-10-20 01:53:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:16,350 INFO L225 Difference]: With dead ends: 548 [2020-10-20 01:53:16,351 INFO L226 Difference]: Without dead ends: 272 [2020-10-20 01:53:16,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-20 01:53:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2020-10-20 01:53:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-10-20 01:53:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 412 transitions. [2020-10-20 01:53:16,432 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 412 transitions. Word has length 61 [2020-10-20 01:53:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:16,433 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 412 transitions. [2020-10-20 01:53:16,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 412 transitions. [2020-10-20 01:53:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:16,438 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:16,440 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-10-20 01:53:16,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:53:16,454 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:16,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1195707667, now seen corresponding path program 1 times [2020-10-20 01:53:16,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:16,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129710918] [2020-10-20 01:53:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:16,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129710918] [2020-10-20 01:53:16,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:16,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:16,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794236796] [2020-10-20 01:53:16,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:16,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:16,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:16,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:16,526 INFO L87 Difference]: Start difference. First operand 272 states and 412 transitions. Second operand 3 states. [2020-10-20 01:53:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:16,640 INFO L93 Difference]: Finished difference Result 730 states and 1104 transitions. [2020-10-20 01:53:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:16,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-10-20 01:53:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:16,645 INFO L225 Difference]: With dead ends: 730 [2020-10-20 01:53:16,646 INFO L226 Difference]: Without dead ends: 466 [2020-10-20 01:53:16,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-10-20 01:53:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2020-10-20 01:53:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-20 01:53:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 694 transitions. [2020-10-20 01:53:16,747 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 694 transitions. Word has length 61 [2020-10-20 01:53:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:16,748 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 694 transitions. [2020-10-20 01:53:16,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 694 transitions. [2020-10-20 01:53:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:16,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:16,752 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-10-20 01:53:16,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:53:16,752 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash 266288339, now seen corresponding path program 1 times [2020-10-20 01:53:16,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:16,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333793998] [2020-10-20 01:53:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:16,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333793998] [2020-10-20 01:53:16,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:16,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:16,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167502060] [2020-10-20 01:53:16,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:16,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:16,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:16,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:16,837 INFO L87 Difference]: Start difference. First operand 464 states and 694 transitions. Second operand 3 states. [2020-10-20 01:53:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:16,893 INFO L93 Difference]: Finished difference Result 919 states and 1375 transitions. [2020-10-20 01:53:16,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:16,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-10-20 01:53:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:16,897 INFO L225 Difference]: With dead ends: 919 [2020-10-20 01:53:16,898 INFO L226 Difference]: Without dead ends: 464 [2020-10-20 01:53:16,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-20 01:53:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-10-20 01:53:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-20 01:53:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 686 transitions. [2020-10-20 01:53:16,927 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 686 transitions. Word has length 61 [2020-10-20 01:53:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:16,927 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 686 transitions. [2020-10-20 01:53:16,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 686 transitions. [2020-10-20 01:53:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:16,929 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:16,929 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-10-20 01:53:16,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:53:16,930 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:16,931 INFO L82 PathProgramCache]: Analyzing trace with hash 710189013, now seen corresponding path program 1 times [2020-10-20 01:53:16,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:16,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255101691] [2020-10-20 01:53:16,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:16,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255101691] [2020-10-20 01:53:16,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:16,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:16,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579870703] [2020-10-20 01:53:16,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:16,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:16,991 INFO L87 Difference]: Start difference. First operand 464 states and 686 transitions. Second operand 3 states. [2020-10-20 01:53:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:17,042 INFO L93 Difference]: Finished difference Result 918 states and 1358 transitions. [2020-10-20 01:53:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:17,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-10-20 01:53:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:17,046 INFO L225 Difference]: With dead ends: 918 [2020-10-20 01:53:17,047 INFO L226 Difference]: Without dead ends: 464 [2020-10-20 01:53:17,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-20 01:53:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-10-20 01:53:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-20 01:53:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 678 transitions. [2020-10-20 01:53:17,079 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 678 transitions. Word has length 61 [2020-10-20 01:53:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:17,081 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 678 transitions. [2020-10-20 01:53:17,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 678 transitions. [2020-10-20 01:53:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:17,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:17,087 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-10-20 01:53:17,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:53:17,088 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:17,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1623736427, now seen corresponding path program 1 times [2020-10-20 01:53:17,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:17,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389941120] [2020-10-20 01:53:17,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:17,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389941120] [2020-10-20 01:53:17,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:17,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:17,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486640104] [2020-10-20 01:53:17,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:17,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:17,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:17,189 INFO L87 Difference]: Start difference. First operand 464 states and 678 transitions. Second operand 3 states. [2020-10-20 01:53:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:17,238 INFO L93 Difference]: Finished difference Result 917 states and 1341 transitions. [2020-10-20 01:53:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:17,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-10-20 01:53:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:17,241 INFO L225 Difference]: With dead ends: 917 [2020-10-20 01:53:17,242 INFO L226 Difference]: Without dead ends: 464 [2020-10-20 01:53:17,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-20 01:53:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-10-20 01:53:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-20 01:53:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 670 transitions. [2020-10-20 01:53:17,276 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 670 transitions. Word has length 61 [2020-10-20 01:53:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:17,276 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 670 transitions. [2020-10-20 01:53:17,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 670 transitions. [2020-10-20 01:53:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:17,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:17,279 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-10-20 01:53:17,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:53:17,279 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash -175003691, now seen corresponding path program 1 times [2020-10-20 01:53:17,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:17,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453483955] [2020-10-20 01:53:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:17,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453483955] [2020-10-20 01:53:17,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:17,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:17,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308850182] [2020-10-20 01:53:17,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:17,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:17,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:17,351 INFO L87 Difference]: Start difference. First operand 464 states and 670 transitions. Second operand 3 states. [2020-10-20 01:53:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:17,418 INFO L93 Difference]: Finished difference Result 916 states and 1324 transitions. [2020-10-20 01:53:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:17,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-10-20 01:53:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:17,421 INFO L225 Difference]: With dead ends: 916 [2020-10-20 01:53:17,421 INFO L226 Difference]: Without dead ends: 464 [2020-10-20 01:53:17,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-20 01:53:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-10-20 01:53:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-20 01:53:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 654 transitions. [2020-10-20 01:53:17,444 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 654 transitions. Word has length 61 [2020-10-20 01:53:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:17,444 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 654 transitions. [2020-10-20 01:53:17,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 654 transitions. [2020-10-20 01:53:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:17,446 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:17,446 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-10-20 01:53:17,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:53:17,446 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1945036492, now seen corresponding path program 1 times [2020-10-20 01:53:17,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:17,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632670274] [2020-10-20 01:53:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:17,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632670274] [2020-10-20 01:53:17,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:17,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:17,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626186014] [2020-10-20 01:53:17,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:17,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:17,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:17,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:17,483 INFO L87 Difference]: Start difference. First operand 464 states and 654 transitions. Second operand 3 states. [2020-10-20 01:53:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:17,568 INFO L93 Difference]: Finished difference Result 914 states and 1289 transitions. [2020-10-20 01:53:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:17,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-10-20 01:53:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:17,571 INFO L225 Difference]: With dead ends: 914 [2020-10-20 01:53:17,571 INFO L226 Difference]: Without dead ends: 464 [2020-10-20 01:53:17,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-20 01:53:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-10-20 01:53:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-20 01:53:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 638 transitions. [2020-10-20 01:53:17,596 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 638 transitions. Word has length 61 [2020-10-20 01:53:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:17,597 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 638 transitions. [2020-10-20 01:53:17,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 638 transitions. [2020-10-20 01:53:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:17,598 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:17,598 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-10-20 01:53:17,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:53:17,599 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1902661357, now seen corresponding path program 1 times [2020-10-20 01:53:17,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:17,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543567988] [2020-10-20 01:53:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:17,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543567988] [2020-10-20 01:53:17,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:17,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:17,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752688643] [2020-10-20 01:53:17,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:17,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:17,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:17,692 INFO L87 Difference]: Start difference. First operand 464 states and 638 transitions. Second operand 5 states. [2020-10-20 01:53:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:17,910 INFO L93 Difference]: Finished difference Result 1468 states and 2029 transitions. [2020-10-20 01:53:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:17,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-10-20 01:53:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:17,918 INFO L225 Difference]: With dead ends: 1468 [2020-10-20 01:53:17,918 INFO L226 Difference]: Without dead ends: 1025 [2020-10-20 01:53:17,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2020-10-20 01:53:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 479. [2020-10-20 01:53:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-10-20 01:53:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 648 transitions. [2020-10-20 01:53:17,955 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 648 transitions. Word has length 61 [2020-10-20 01:53:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:17,955 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 648 transitions. [2020-10-20 01:53:17,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 648 transitions. [2020-10-20 01:53:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:17,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:17,957 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-10-20 01:53:17,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:53:17,957 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1654514863, now seen corresponding path program 1 times [2020-10-20 01:53:17,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:17,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533462219] [2020-10-20 01:53:17,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:17,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533462219] [2020-10-20 01:53:17,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:17,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:17,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294247956] [2020-10-20 01:53:17,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:17,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:17,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:18,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:18,000 INFO L87 Difference]: Start difference. First operand 479 states and 648 transitions. Second operand 5 states. [2020-10-20 01:53:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:18,180 INFO L93 Difference]: Finished difference Result 1256 states and 1713 transitions. [2020-10-20 01:53:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:18,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-10-20 01:53:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:18,186 INFO L225 Difference]: With dead ends: 1256 [2020-10-20 01:53:18,186 INFO L226 Difference]: Without dead ends: 805 [2020-10-20 01:53:18,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-10-20 01:53:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 485. [2020-10-20 01:53:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-10-20 01:53:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 646 transitions. [2020-10-20 01:53:18,246 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 646 transitions. Word has length 61 [2020-10-20 01:53:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:18,246 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 646 transitions. [2020-10-20 01:53:18,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 646 transitions. [2020-10-20 01:53:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:18,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:18,247 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-10-20 01:53:18,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:53:18,248 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2048881649, now seen corresponding path program 1 times [2020-10-20 01:53:18,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:18,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434142479] [2020-10-20 01:53:18,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:18,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434142479] [2020-10-20 01:53:18,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:18,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:18,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566034943] [2020-10-20 01:53:18,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:18,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:18,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:18,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:18,291 INFO L87 Difference]: Start difference. First operand 485 states and 646 transitions. Second operand 5 states. [2020-10-20 01:53:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:18,516 INFO L93 Difference]: Finished difference Result 1610 states and 2151 transitions. [2020-10-20 01:53:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:18,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-10-20 01:53:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:18,526 INFO L225 Difference]: With dead ends: 1610 [2020-10-20 01:53:18,526 INFO L226 Difference]: Without dead ends: 1160 [2020-10-20 01:53:18,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-10-20 01:53:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 515. [2020-10-20 01:53:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-10-20 01:53:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 676 transitions. [2020-10-20 01:53:18,572 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 676 transitions. Word has length 61 [2020-10-20 01:53:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:18,573 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 676 transitions. [2020-10-20 01:53:18,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 676 transitions. [2020-10-20 01:53:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:18,574 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:18,574 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-10-20 01:53:18,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 01:53:18,575 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:18,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2026249395, now seen corresponding path program 1 times [2020-10-20 01:53:18,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:18,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189748447] [2020-10-20 01:53:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:18,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189748447] [2020-10-20 01:53:18,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:18,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:53:18,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926594085] [2020-10-20 01:53:18,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:53:18,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:18,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:53:18,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:18,658 INFO L87 Difference]: Start difference. First operand 515 states and 676 transitions. Second operand 5 states. [2020-10-20 01:53:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:18,835 INFO L93 Difference]: Finished difference Result 1397 states and 1850 transitions. [2020-10-20 01:53:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:53:18,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-10-20 01:53:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:18,843 INFO L225 Difference]: With dead ends: 1397 [2020-10-20 01:53:18,843 INFO L226 Difference]: Without dead ends: 927 [2020-10-20 01:53:18,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 01:53:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-10-20 01:53:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 521. [2020-10-20 01:53:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-10-20 01:53:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 674 transitions. [2020-10-20 01:53:18,889 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 674 transitions. Word has length 61 [2020-10-20 01:53:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:18,889 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 674 transitions. [2020-10-20 01:53:18,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:53:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 674 transitions. [2020-10-20 01:53:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:18,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:18,890 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-10-20 01:53:18,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:53:18,891 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2134704395, now seen corresponding path program 1 times [2020-10-20 01:53:18,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:18,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012695235] [2020-10-20 01:53:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:18,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012695235] [2020-10-20 01:53:18,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:18,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:18,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799966639] [2020-10-20 01:53:18,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:18,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:18,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:18,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:18,942 INFO L87 Difference]: Start difference. First operand 521 states and 674 transitions. Second operand 3 states. [2020-10-20 01:53:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:19,029 INFO L93 Difference]: Finished difference Result 1005 states and 1299 transitions. [2020-10-20 01:53:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:19,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-10-20 01:53:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:19,033 INFO L225 Difference]: With dead ends: 1005 [2020-10-20 01:53:19,033 INFO L226 Difference]: Without dead ends: 497 [2020-10-20 01:53:19,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-10-20 01:53:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2020-10-20 01:53:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-10-20 01:53:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 626 transitions. [2020-10-20 01:53:19,073 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 626 transitions. Word has length 61 [2020-10-20 01:53:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:19,074 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 626 transitions. [2020-10-20 01:53:19,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 626 transitions. [2020-10-20 01:53:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-20 01:53:19,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:19,075 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-10-20 01:53:19,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:53:19,075 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:19,075 INFO L82 PathProgramCache]: Analyzing trace with hash 140559689, now seen corresponding path program 1 times [2020-10-20 01:53:19,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:19,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519157584] [2020-10-20 01:53:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:19,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519157584] [2020-10-20 01:53:19,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:19,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:19,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958398783] [2020-10-20 01:53:19,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:19,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:19,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:19,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:19,128 INFO L87 Difference]: Start difference. First operand 497 states and 626 transitions. Second operand 3 states. [2020-10-20 01:53:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:19,237 INFO L93 Difference]: Finished difference Result 1368 states and 1714 transitions. [2020-10-20 01:53:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:19,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-10-20 01:53:19,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:19,243 INFO L225 Difference]: With dead ends: 1368 [2020-10-20 01:53:19,244 INFO L226 Difference]: Without dead ends: 920 [2020-10-20 01:53:19,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2020-10-20 01:53:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 891. [2020-10-20 01:53:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2020-10-20 01:53:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1103 transitions. [2020-10-20 01:53:19,317 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1103 transitions. Word has length 61 [2020-10-20 01:53:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:19,319 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1103 transitions. [2020-10-20 01:53:19,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1103 transitions. [2020-10-20 01:53:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-20 01:53:19,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:19,320 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-10-20 01:53:19,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:53:19,321 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash 327530686, now seen corresponding path program 1 times [2020-10-20 01:53:19,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:19,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963721603] [2020-10-20 01:53:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:19,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963721603] [2020-10-20 01:53:19,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:19,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:19,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690350365] [2020-10-20 01:53:19,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:19,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:19,362 INFO L87 Difference]: Start difference. First operand 891 states and 1103 transitions. Second operand 3 states. [2020-10-20 01:53:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:19,509 INFO L93 Difference]: Finished difference Result 2319 states and 2877 transitions. [2020-10-20 01:53:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:19,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-10-20 01:53:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:19,517 INFO L225 Difference]: With dead ends: 2319 [2020-10-20 01:53:19,518 INFO L226 Difference]: Without dead ends: 1522 [2020-10-20 01:53:19,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2020-10-20 01:53:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1520. [2020-10-20 01:53:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2020-10-20 01:53:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1870 transitions. [2020-10-20 01:53:19,648 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1870 transitions. Word has length 62 [2020-10-20 01:53:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:19,648 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 1870 transitions. [2020-10-20 01:53:19,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1870 transitions. [2020-10-20 01:53:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 01:53:19,649 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:19,650 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-10-20 01:53:19,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:53:19,650 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash -479572275, now seen corresponding path program 1 times [2020-10-20 01:53:19,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:19,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629528725] [2020-10-20 01:53:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:19,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629528725] [2020-10-20 01:53:19,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:19,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:19,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567267829] [2020-10-20 01:53:19,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:19,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:19,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:19,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:19,699 INFO L87 Difference]: Start difference. First operand 1520 states and 1870 transitions. Second operand 3 states. [2020-10-20 01:53:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:19,926 INFO L93 Difference]: Finished difference Result 4144 states and 5092 transitions. [2020-10-20 01:53:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:19,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-10-20 01:53:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:19,939 INFO L225 Difference]: With dead ends: 4144 [2020-10-20 01:53:19,939 INFO L226 Difference]: Without dead ends: 2718 [2020-10-20 01:53:19,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-10-20 01:53:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2020-10-20 01:53:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2716. [2020-10-20 01:53:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2020-10-20 01:53:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3314 transitions. [2020-10-20 01:53:20,207 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3314 transitions. Word has length 63 [2020-10-20 01:53:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:20,208 INFO L481 AbstractCegarLoop]: Abstraction has 2716 states and 3314 transitions. [2020-10-20 01:53:20,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3314 transitions. [2020-10-20 01:53:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 01:53:20,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:20,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 01:53:20,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:53:20,211 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash -45843189, now seen corresponding path program 1 times [2020-10-20 01:53:20,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:20,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117258535] [2020-10-20 01:53:20,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:20,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117258535] [2020-10-20 01:53:20,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:20,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:20,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231727863] [2020-10-20 01:53:20,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:20,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:20,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:20,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:20,251 INFO L87 Difference]: Start difference. First operand 2716 states and 3314 transitions. Second operand 3 states. [2020-10-20 01:53:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:20,797 INFO L93 Difference]: Finished difference Result 5252 states and 6425 transitions. [2020-10-20 01:53:20,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:20,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-10-20 01:53:20,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:20,809 INFO L225 Difference]: With dead ends: 5252 [2020-10-20 01:53:20,809 INFO L226 Difference]: Without dead ends: 2630 [2020-10-20 01:53:20,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2020-10-20 01:53:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630. [2020-10-20 01:53:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2020-10-20 01:53:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3216 transitions. [2020-10-20 01:53:21,019 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3216 transitions. Word has length 63 [2020-10-20 01:53:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:21,020 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 3216 transitions. [2020-10-20 01:53:21,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3216 transitions. [2020-10-20 01:53:21,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-20 01:53:21,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:21,022 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-10-20 01:53:21,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:53:21,022 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash -709022745, now seen corresponding path program 1 times [2020-10-20 01:53:21,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:21,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270181323] [2020-10-20 01:53:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:21,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270181323] [2020-10-20 01:53:21,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:21,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:21,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600640239] [2020-10-20 01:53:21,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:21,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:21,100 INFO L87 Difference]: Start difference. First operand 2630 states and 3216 transitions. Second operand 3 states. [2020-10-20 01:53:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:21,615 INFO L93 Difference]: Finished difference Result 7634 states and 9339 transitions. [2020-10-20 01:53:21,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:21,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-10-20 01:53:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:21,639 INFO L225 Difference]: With dead ends: 7634 [2020-10-20 01:53:21,639 INFO L226 Difference]: Without dead ends: 5074 [2020-10-20 01:53:21,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2020-10-20 01:53:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5042. [2020-10-20 01:53:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2020-10-20 01:53:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 6106 transitions. [2020-10-20 01:53:22,053 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 6106 transitions. Word has length 64 [2020-10-20 01:53:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:22,053 INFO L481 AbstractCegarLoop]: Abstraction has 5042 states and 6106 transitions. [2020-10-20 01:53:22,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 6106 transitions. [2020-10-20 01:53:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-20 01:53:22,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:22,057 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-10-20 01:53:22,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:53:22,058 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:22,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:22,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1717276157, now seen corresponding path program 1 times [2020-10-20 01:53:22,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:22,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725358583] [2020-10-20 01:53:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:22,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725358583] [2020-10-20 01:53:22,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:22,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:22,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487551031] [2020-10-20 01:53:22,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:22,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:22,102 INFO L87 Difference]: Start difference. First operand 5042 states and 6106 transitions. Second operand 4 states. [2020-10-20 01:53:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:22,953 INFO L93 Difference]: Finished difference Result 14910 states and 18027 transitions. [2020-10-20 01:53:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:22,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-10-20 01:53:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:22,990 INFO L225 Difference]: With dead ends: 14910 [2020-10-20 01:53:22,990 INFO L226 Difference]: Without dead ends: 7496 [2020-10-20 01:53:23,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7496 states. [2020-10-20 01:53:23,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7496 to 7496. [2020-10-20 01:53:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7496 states. [2020-10-20 01:53:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 9042 transitions. [2020-10-20 01:53:23,857 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 9042 transitions. Word has length 81 [2020-10-20 01:53:23,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:23,858 INFO L481 AbstractCegarLoop]: Abstraction has 7496 states and 9042 transitions. [2020-10-20 01:53:23,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 9042 transitions. [2020-10-20 01:53:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-10-20 01:53:23,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:23,865 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-10-20 01:53:23,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 01:53:23,865 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:23,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:23,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1115959489, now seen corresponding path program 1 times [2020-10-20 01:53:23,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:23,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608503856] [2020-10-20 01:53:23,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-20 01:53:23,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608503856] [2020-10-20 01:53:23,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:23,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:23,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244140546] [2020-10-20 01:53:23,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:23,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:23,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:23,919 INFO L87 Difference]: Start difference. First operand 7496 states and 9042 transitions. Second operand 3 states. [2020-10-20 01:53:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:24,587 INFO L93 Difference]: Finished difference Result 17102 states and 20603 transitions. [2020-10-20 01:53:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:24,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2020-10-20 01:53:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:24,610 INFO L225 Difference]: With dead ends: 17102 [2020-10-20 01:53:24,610 INFO L226 Difference]: Without dead ends: 9662 [2020-10-20 01:53:24,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9662 states. [2020-10-20 01:53:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9662 to 9614. [2020-10-20 01:53:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2020-10-20 01:53:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 11518 transitions. [2020-10-20 01:53:25,202 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 11518 transitions. Word has length 110 [2020-10-20 01:53:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:25,203 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 11518 transitions. [2020-10-20 01:53:25,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 11518 transitions. [2020-10-20 01:53:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-20 01:53:25,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:25,210 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-10-20 01:53:25,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 01:53:25,211 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:25,211 INFO L82 PathProgramCache]: Analyzing trace with hash 577449217, now seen corresponding path program 1 times [2020-10-20 01:53:25,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:25,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704065491] [2020-10-20 01:53:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:25,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704065491] [2020-10-20 01:53:25,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:25,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:25,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816675868] [2020-10-20 01:53:25,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:25,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:25,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:25,258 INFO L87 Difference]: Start difference. First operand 9614 states and 11518 transitions. Second operand 4 states. [2020-10-20 01:53:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:26,674 INFO L93 Difference]: Finished difference Result 17020 states and 20462 transitions. [2020-10-20 01:53:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:26,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2020-10-20 01:53:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:26,697 INFO L225 Difference]: With dead ends: 17020 [2020-10-20 01:53:26,697 INFO L226 Difference]: Without dead ends: 9616 [2020-10-20 01:53:26,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9616 states. [2020-10-20 01:53:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9616 to 9614. [2020-10-20 01:53:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2020-10-20 01:53:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 11476 transitions. [2020-10-20 01:53:27,153 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 11476 transitions. Word has length 113 [2020-10-20 01:53:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:27,154 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 11476 transitions. [2020-10-20 01:53:27,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 11476 transitions. [2020-10-20 01:53:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-10-20 01:53:27,163 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:27,163 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-10-20 01:53:27,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 01:53:27,163 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash 163247736, now seen corresponding path program 1 times [2020-10-20 01:53:27,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:27,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239384267] [2020-10-20 01:53:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 01:53:27,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239384267] [2020-10-20 01:53:27,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:27,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 01:53:27,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082183102] [2020-10-20 01:53:27,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:27,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:27,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:27,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:27,223 INFO L87 Difference]: Start difference. First operand 9614 states and 11476 transitions. Second operand 3 states. [2020-10-20 01:53:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:28,147 INFO L93 Difference]: Finished difference Result 21076 states and 25107 transitions. [2020-10-20 01:53:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:28,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-10-20 01:53:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:28,174 INFO L225 Difference]: With dead ends: 21076 [2020-10-20 01:53:28,174 INFO L226 Difference]: Without dead ends: 11504 [2020-10-20 01:53:28,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11504 states. [2020-10-20 01:53:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11504 to 11440. [2020-10-20 01:53:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-10-20 01:53:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13564 transitions. [2020-10-20 01:53:29,042 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13564 transitions. Word has length 142 [2020-10-20 01:53:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:29,043 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13564 transitions. [2020-10-20 01:53:29,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13564 transitions. [2020-10-20 01:53:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-10-20 01:53:29,052 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:29,052 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-10-20 01:53:29,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 01:53:29,053 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1331585155, now seen corresponding path program 1 times [2020-10-20 01:53:29,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:29,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261149791] [2020-10-20 01:53:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:29,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261149791] [2020-10-20 01:53:29,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:29,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:53:29,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708513397] [2020-10-20 01:53:29,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:53:29,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:53:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:53:29,107 INFO L87 Difference]: Start difference. First operand 11440 states and 13564 transitions. Second operand 4 states. [2020-10-20 01:53:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:29,972 INFO L93 Difference]: Finished difference Result 20966 states and 24946 transitions. [2020-10-20 01:53:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:53:29,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-10-20 01:53:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:29,996 INFO L225 Difference]: With dead ends: 20966 [2020-10-20 01:53:29,997 INFO L226 Difference]: Without dead ends: 11442 [2020-10-20 01:53:30,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:53:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2020-10-20 01:53:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11440. [2020-10-20 01:53:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-10-20 01:53:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13484 transitions. [2020-10-20 01:53:30,645 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13484 transitions. Word has length 145 [2020-10-20 01:53:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:30,645 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13484 transitions. [2020-10-20 01:53:30,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:53:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13484 transitions. [2020-10-20 01:53:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-10-20 01:53:30,654 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:30,655 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-10-20 01:53:30,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 01:53:30,655 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1031093230, now seen corresponding path program 1 times [2020-10-20 01:53:30,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:30,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239488245] [2020-10-20 01:53:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:30,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239488245] [2020-10-20 01:53:30,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:30,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:30,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184115047] [2020-10-20 01:53:30,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:30,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:30,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:30,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:30,731 INFO L87 Difference]: Start difference. First operand 11440 states and 13484 transitions. Second operand 3 states. [2020-10-20 01:53:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:31,337 INFO L93 Difference]: Finished difference Result 19782 states and 23399 transitions. [2020-10-20 01:53:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:31,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-10-20 01:53:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:31,351 INFO L225 Difference]: With dead ends: 19782 [2020-10-20 01:53:31,352 INFO L226 Difference]: Without dead ends: 11472 [2020-10-20 01:53:31,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2020-10-20 01:53:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 11440. [2020-10-20 01:53:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-10-20 01:53:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13276 transitions. [2020-10-20 01:53:32,339 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13276 transitions. Word has length 174 [2020-10-20 01:53:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:32,339 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13276 transitions. [2020-10-20 01:53:32,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13276 transitions. [2020-10-20 01:53:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-10-20 01:53:32,348 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:32,349 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-10-20 01:53:32,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-20 01:53:32,349 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:32,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash 807546521, now seen corresponding path program 1 times [2020-10-20 01:53:32,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:32,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692972221] [2020-10-20 01:53:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:32,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692972221] [2020-10-20 01:53:32,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:32,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:32,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898995079] [2020-10-20 01:53:32,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:32,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:32,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:32,419 INFO L87 Difference]: Start difference. First operand 11440 states and 13276 transitions. Second operand 3 states. [2020-10-20 01:53:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:33,227 INFO L93 Difference]: Finished difference Result 18390 states and 21415 transitions. [2020-10-20 01:53:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:33,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-10-20 01:53:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:33,240 INFO L225 Difference]: With dead ends: 18390 [2020-10-20 01:53:33,240 INFO L226 Difference]: Without dead ends: 11440 [2020-10-20 01:53:33,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11440 states. [2020-10-20 01:53:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11440 to 11410. [2020-10-20 01:53:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11410 states. [2020-10-20 01:53:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11410 states to 11410 states and 13082 transitions. [2020-10-20 01:53:34,054 INFO L78 Accepts]: Start accepts. Automaton has 11410 states and 13082 transitions. Word has length 176 [2020-10-20 01:53:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:34,055 INFO L481 AbstractCegarLoop]: Abstraction has 11410 states and 13082 transitions. [2020-10-20 01:53:34,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 11410 states and 13082 transitions. [2020-10-20 01:53:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-10-20 01:53:34,062 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:34,062 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-10-20 01:53:34,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-20 01:53:34,063 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash 251088387, now seen corresponding path program 1 times [2020-10-20 01:53:34,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:34,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406732032] [2020-10-20 01:53:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 01:53:34,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406732032] [2020-10-20 01:53:34,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:34,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:34,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546450167] [2020-10-20 01:53:34,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:34,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:34,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:34,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:34,129 INFO L87 Difference]: Start difference. First operand 11410 states and 13082 transitions. Second operand 3 states. [2020-10-20 01:53:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:34,832 INFO L93 Difference]: Finished difference Result 22664 states and 25781 transitions. [2020-10-20 01:53:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:34,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-10-20 01:53:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:34,839 INFO L225 Difference]: With dead ends: 22664 [2020-10-20 01:53:34,839 INFO L226 Difference]: Without dead ends: 6788 [2020-10-20 01:53:34,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6788 states. [2020-10-20 01:53:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6788 to 6580. [2020-10-20 01:53:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6580 states. [2020-10-20 01:53:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7246 transitions. [2020-10-20 01:53:35,172 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7246 transitions. Word has length 178 [2020-10-20 01:53:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:35,173 INFO L481 AbstractCegarLoop]: Abstraction has 6580 states and 7246 transitions. [2020-10-20 01:53:35,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7246 transitions. [2020-10-20 01:53:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-20 01:53:35,178 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:35,179 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-10-20 01:53:35,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-20 01:53:35,179 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:35,179 INFO L82 PathProgramCache]: Analyzing trace with hash -32931800, now seen corresponding path program 1 times [2020-10-20 01:53:35,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:35,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661485836] [2020-10-20 01:53:35,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:53:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:53:35,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661485836] [2020-10-20 01:53:35,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:53:35,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:53:35,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931476013] [2020-10-20 01:53:35,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:53:35,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:53:35,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:53:35,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:35,239 INFO L87 Difference]: Start difference. First operand 6580 states and 7246 transitions. Second operand 3 states. [2020-10-20 01:53:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:53:35,610 INFO L93 Difference]: Finished difference Result 11554 states and 12749 transitions. [2020-10-20 01:53:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:53:35,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-10-20 01:53:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:53:35,616 INFO L225 Difference]: With dead ends: 11554 [2020-10-20 01:53:35,616 INFO L226 Difference]: Without dead ends: 6580 [2020-10-20 01:53:35,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:53:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2020-10-20 01:53:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6580. [2020-10-20 01:53:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6580 states. [2020-10-20 01:53:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7168 transitions. [2020-10-20 01:53:35,987 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7168 transitions. Word has length 180 [2020-10-20 01:53:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:53:35,987 INFO L481 AbstractCegarLoop]: Abstraction has 6580 states and 7168 transitions. [2020-10-20 01:53:35,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:53:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7168 transitions. [2020-10-20 01:53:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-10-20 01:53:35,992 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:53:35,992 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-10-20 01:53:35,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-20 01:53:35,993 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:53:35,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:53:35,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1382104249, now seen corresponding path program 1 times [2020-10-20 01:53:35,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:53:35,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247779049] [2020-10-20 01:53:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:53:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:53:36,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:53:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 01:53:36,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 01:53:36,155 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 01:53:36,156 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 01:53:36,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-20 01:53:36,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:53:36 BoogieIcfgContainer [2020-10-20 01:53:36,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:53:36,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:53:36,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:53:36,407 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:53:36,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:53:15" (3/4) ... [2020-10-20 01:53:36,410 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 01:53:36,577 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:53:36,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:53:36,580 INFO L168 Benchmark]: Toolchain (without parser) took 22485.79 ms. Allocated memory was 38.3 MB in the beginning and 580.9 MB in the end (delta: 542.6 MB). Free memory was 19.4 MB in the beginning and 280.5 MB in the end (delta: -261.1 MB). Peak memory consumption was 281.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:36,580 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 37.2 MB. Free memory was 14.2 MB in the beginning and 14.2 MB in the end (delta: 45.8 kB). Peak memory consumption was 45.8 kB. Max. memory is 14.3 GB. [2020-10-20 01:53:36,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.16 ms. Allocated memory was 38.3 MB in the beginning and 44.6 MB in the end (delta: 6.3 MB). Free memory was 18.6 MB in the beginning and 22.5 MB in the end (delta: -4.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:36,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.76 ms. Allocated memory is still 44.6 MB. Free memory was 22.5 MB in the beginning and 18.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:36,582 INFO L168 Benchmark]: Boogie Preprocessor took 97.41 ms. Allocated memory was 44.6 MB in the beginning and 45.1 MB in the end (delta: 524.3 kB). Free memory was 18.7 MB in the beginning and 26.0 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:36,582 INFO L168 Benchmark]: RCFGBuilder took 1108.17 ms. Allocated memory was 45.1 MB in the beginning and 49.8 MB in the end (delta: 4.7 MB). Free memory was 25.8 MB in the beginning and 26.4 MB in the end (delta: -586.1 kB). Peak memory consumption was 16.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:36,583 INFO L168 Benchmark]: TraceAbstraction took 20567.41 ms. Allocated memory was 49.8 MB in the beginning and 580.9 MB in the end (delta: 531.1 MB). Free memory was 25.7 MB in the beginning and 313.6 MB in the end (delta: -287.9 MB). Peak memory consumption was 243.2 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:36,583 INFO L168 Benchmark]: Witness Printer took 171.05 ms. Allocated memory is still 580.9 MB. Free memory was 313.6 MB in the beginning and 280.5 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:53:36,587 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.32 ms. Allocated memory is still 37.2 MB. Free memory was 14.2 MB in the beginning and 14.2 MB in the end (delta: 45.8 kB). Peak memory consumption was 45.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 463.16 ms. Allocated memory was 38.3 MB in the beginning and 44.6 MB in the end (delta: 6.3 MB). Free memory was 18.6 MB in the beginning and 22.5 MB in the end (delta: -4.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 66.76 ms. Allocated memory is still 44.6 MB. Free memory was 22.5 MB in the beginning and 18.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 97.41 ms. Allocated memory was 44.6 MB in the beginning and 45.1 MB in the end (delta: 524.3 kB). Free memory was 18.7 MB in the beginning and 26.0 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1108.17 ms. Allocated memory was 45.1 MB in the beginning and 49.8 MB in the end (delta: 4.7 MB). Free memory was 25.8 MB in the beginning and 26.4 MB in the end (delta: -586.1 kB). Peak memory consumption was 16.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 20567.41 ms. Allocated memory was 49.8 MB in the beginning and 580.9 MB in the end (delta: 531.1 MB). Free memory was 25.7 MB in the beginning and 313.6 MB in the end (delta: -287.9 MB). Peak memory consumption was 243.2 MB. Max. memory is 14.3 GB. * Witness Printer took 171.05 ms. Allocated memory is still 580.9 MB. Free memory was 313.6 MB in the beginning and 280.5 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int t3_pc = 0; [L21] int 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: 20.2s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 10.6s, 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.2s 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: 7.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 2370 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s 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...