./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-1.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/psyco/psyco_abp_1-1.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 8e1064ca8851049d7703c5646c80faf613ee8a93 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 00:00:12,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:00:12,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:00:12,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:00:12,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:00:12,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:00:12,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:00:12,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:00:12,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:00:12,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:00:12,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:00:12,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:00:12,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:00:12,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:00:12,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:00:12,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:00:12,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:00:12,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:00:12,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:00:12,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:00:12,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:00:12,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:00:12,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:00:12,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:00:12,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:00:12,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:00:12,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:00:12,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:00:12,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:00:12,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:00:12,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:00:12,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:00:12,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:00:12,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:00:12,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:00:12,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:00:12,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:00:12,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:00:12,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:00:12,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:00:12,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:00:12,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 00:00:12,863 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:00:12,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:00:12,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:00:12,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:00:12,867 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:00:12,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:00:12,867 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:00:12,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:00:12,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:00:12,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:00:12,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:00:12,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:00:12,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:00:12,870 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:00:12,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:00:12,871 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:00:12,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:00:12,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:00:12,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:00:12,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:00:12,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:00:12,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:00:12,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:00:12,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:00:12,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:00:12,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:00:12,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:00:12,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:00:12,874 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:00:12,874 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 -> 8e1064ca8851049d7703c5646c80faf613ee8a93 [2020-10-20 00:00:13,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:00:13,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:00:13,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:00:13,091 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:00:13,091 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:00:13,092 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2020-10-20 00:00:13,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02397d8f5/0c7391d365c445e6b66a0a5000ecf04a/FLAGd78359552 [2020-10-20 00:00:13,681 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:00:13,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2020-10-20 00:00:13,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02397d8f5/0c7391d365c445e6b66a0a5000ecf04a/FLAGd78359552 [2020-10-20 00:00:14,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02397d8f5/0c7391d365c445e6b66a0a5000ecf04a [2020-10-20 00:00:14,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:00:14,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:00:14,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:00:14,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:00:14,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:00:14,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2d5f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14, skipping insertion in model container [2020-10-20 00:00:14,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:00:14,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:00:14,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:00:14,476 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:00:14,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:00:14,558 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:00:14,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14 WrapperNode [2020-10-20 00:00:14,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:00:14,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:00:14,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:00:14,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:00:14,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:00:14,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:00:14,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:00:14,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:00:14,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (1/1) ... [2020-10-20 00:00:14,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:00:14,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:00:14,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:00:14,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:00:14,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00: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 00:00:14,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:00:14,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:00:14,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:00:14,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:00:15,868 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:00:15,869 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-20 00:00:15,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:00:15 BoogieIcfgContainer [2020-10-20 00:00:15,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:00:15,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:00:15,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:00:15,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:00:15,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:00:14" (1/3) ... [2020-10-20 00:00:15,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d2e8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:00:15, skipping insertion in model container [2020-10-20 00:00:15,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:00:14" (2/3) ... [2020-10-20 00:00:15,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d2e8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:00:15, skipping insertion in model container [2020-10-20 00:00:15,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:00:15" (3/3) ... [2020-10-20 00:00:15,881 INFO L111 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2020-10-20 00:00:15,893 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:00:15,901 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 00:00:15,927 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-20 00:00:15,954 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:00:15,954 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:00:15,954 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:00:15,955 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:00:15,955 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:00:15,955 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:00:15,956 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:00:15,956 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:00:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2020-10-20 00:00:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 00:00:15,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:15,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:15,983 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1895078531, now seen corresponding path program 1 times [2020-10-20 00:00:16,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:16,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617780977] [2020-10-20 00:00:16,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:16,160 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 00:00:16,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617780977] [2020-10-20 00:00:16,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:00:16,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 00:00:16,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83886849] [2020-10-20 00:00:16,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:00:16,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:00:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:00:16,190 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2020-10-20 00:00:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:16,245 INFO L93 Difference]: Finished difference Result 219 states and 421 transitions. [2020-10-20 00:00:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:00:16,247 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-20 00:00:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:16,266 INFO L225 Difference]: With dead ends: 219 [2020-10-20 00:00:16,267 INFO L226 Difference]: Without dead ends: 106 [2020-10-20 00:00:16,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:00:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-20 00:00:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-20 00:00:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-20 00:00:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 177 transitions. [2020-10-20 00:00:16,343 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 177 transitions. Word has length 10 [2020-10-20 00:00:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:16,343 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 177 transitions. [2020-10-20 00:00:16,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:00:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 177 transitions. [2020-10-20 00:00:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 00:00:16,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:16,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:16,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:00:16,346 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:16,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:16,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1914595175, now seen corresponding path program 1 times [2020-10-20 00:00:16,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:16,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159362857] [2020-10-20 00:00:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:16,402 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 00:00:16,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159362857] [2020-10-20 00:00:16,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:00:16,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:00:16,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954983632] [2020-10-20 00:00:16,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:00:16,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:16,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:00:16,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:16,406 INFO L87 Difference]: Start difference. First operand 106 states and 177 transitions. Second operand 3 states. [2020-10-20 00:00:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:16,464 INFO L93 Difference]: Finished difference Result 214 states and 358 transitions. [2020-10-20 00:00:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:00:16,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-20 00:00:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:16,466 INFO L225 Difference]: With dead ends: 214 [2020-10-20 00:00:16,466 INFO L226 Difference]: Without dead ends: 110 [2020-10-20 00:00:16,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-20 00:00:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-20 00:00:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-20 00:00:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 182 transitions. [2020-10-20 00:00:16,478 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 182 transitions. Word has length 11 [2020-10-20 00:00:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:16,478 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 182 transitions. [2020-10-20 00:00:16,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:00:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 182 transitions. [2020-10-20 00:00:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 00:00:16,480 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:16,480 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:16,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:00:16,480 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 100490260, now seen corresponding path program 1 times [2020-10-20 00:00:16,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:16,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201464869] [2020-10-20 00:00:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:16,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201464869] [2020-10-20 00:00:16,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:00:16,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:00:16,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974649397] [2020-10-20 00:00:16,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:00:16,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:16,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:00:16,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:16,679 INFO L87 Difference]: Start difference. First operand 110 states and 182 transitions. Second operand 3 states. [2020-10-20 00:00:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:16,857 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2020-10-20 00:00:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:00:16,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-20 00:00:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:16,860 INFO L225 Difference]: With dead ends: 324 [2020-10-20 00:00:16,860 INFO L226 Difference]: Without dead ends: 195 [2020-10-20 00:00:16,861 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 00:00:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-10-20 00:00:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2020-10-20 00:00:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-20 00:00:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 301 transitions. [2020-10-20 00:00:16,895 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 301 transitions. Word has length 17 [2020-10-20 00:00:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:16,896 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 301 transitions. [2020-10-20 00:00:16,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:00:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 301 transitions. [2020-10-20 00:00:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-20 00:00:16,900 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:16,900 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:16,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:00:16,906 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1571478032, now seen corresponding path program 1 times [2020-10-20 00:00:16,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:16,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410987804] [2020-10-20 00:00:16,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:16,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410987804] [2020-10-20 00:00:16,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:00:16,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:00:16,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497547768] [2020-10-20 00:00:16,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:00:16,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:00:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:16,991 INFO L87 Difference]: Start difference. First operand 184 states and 301 transitions. Second operand 3 states. [2020-10-20 00:00:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:17,042 INFO L93 Difference]: Finished difference Result 314 states and 514 transitions. [2020-10-20 00:00:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:00:17,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-10-20 00:00:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:17,044 INFO L225 Difference]: With dead ends: 314 [2020-10-20 00:00:17,044 INFO L226 Difference]: Without dead ends: 133 [2020-10-20 00:00:17,051 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 00:00:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-20 00:00:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2020-10-20 00:00:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-20 00:00:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 211 transitions. [2020-10-20 00:00:17,070 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 211 transitions. Word has length 18 [2020-10-20 00:00:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:17,072 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 211 transitions. [2020-10-20 00:00:17,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:00:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 211 transitions. [2020-10-20 00:00:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 00:00:17,077 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:17,077 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:17,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:00:17,078 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1260642915, now seen corresponding path program 1 times [2020-10-20 00:00:17,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:17,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710472913] [2020-10-20 00:00:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 00:00:17,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710472913] [2020-10-20 00:00:17,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:00:17,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:00:17,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329436619] [2020-10-20 00:00:17,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:00:17,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:17,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:00:17,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:17,163 INFO L87 Difference]: Start difference. First operand 131 states and 211 transitions. Second operand 3 states. [2020-10-20 00:00:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:17,212 INFO L93 Difference]: Finished difference Result 243 states and 390 transitions. [2020-10-20 00:00:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:00:17,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-20 00:00:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:17,214 INFO L225 Difference]: With dead ends: 243 [2020-10-20 00:00:17,214 INFO L226 Difference]: Without dead ends: 115 [2020-10-20 00:00:17,215 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 00:00:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-20 00:00:17,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2020-10-20 00:00:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-20 00:00:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2020-10-20 00:00:17,223 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 24 [2020-10-20 00:00:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:17,223 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2020-10-20 00:00:17,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:00:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2020-10-20 00:00:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 00:00:17,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:17,225 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:17,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 00:00:17,226 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1813922334, now seen corresponding path program 1 times [2020-10-20 00:00:17,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:17,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104748068] [2020-10-20 00:00:17,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:17,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104748068] [2020-10-20 00:00:17,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38933165] [2020-10-20 00:00:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:17,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 00:00:17,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:17,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:17,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 00:00:17,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380523202] [2020-10-20 00:00:17,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:00:17,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:17,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:00:17,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:00:17,461 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand 5 states. [2020-10-20 00:00:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:17,659 INFO L93 Difference]: Finished difference Result 204 states and 323 transitions. [2020-10-20 00:00:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:00:17,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-10-20 00:00:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:17,661 INFO L225 Difference]: With dead ends: 204 [2020-10-20 00:00:17,661 INFO L226 Difference]: Without dead ends: 192 [2020-10-20 00:00:17,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:00:17,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-20 00:00:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2020-10-20 00:00:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-20 00:00:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 290 transitions. [2020-10-20 00:00:17,669 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 290 transitions. Word has length 26 [2020-10-20 00:00:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:17,670 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 290 transitions. [2020-10-20 00:00:17,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:00:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 290 transitions. [2020-10-20 00:00:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-20 00:00:17,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:17,671 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:17,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-10-20 00:00:17,889 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash 408461028, now seen corresponding path program 1 times [2020-10-20 00:00:17,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:17,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085664322] [2020-10-20 00:00:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:18,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085664322] [2020-10-20 00:00:18,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742544071] [2020-10-20 00:00:18,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:18,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 00:00:18,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:18,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:18,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-20 00:00:18,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698830793] [2020-10-20 00:00:18,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:00:18,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:18,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:00:18,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:00:18,185 INFO L87 Difference]: Start difference. First operand 178 states and 290 transitions. Second operand 5 states. [2020-10-20 00:00:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:18,330 INFO L93 Difference]: Finished difference Result 387 states and 636 transitions. [2020-10-20 00:00:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:00:18,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-10-20 00:00:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:18,333 INFO L225 Difference]: With dead ends: 387 [2020-10-20 00:00:18,333 INFO L226 Difference]: Without dead ends: 230 [2020-10-20 00:00:18,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:00:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-20 00:00:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2020-10-20 00:00:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-10-20 00:00:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 362 transitions. [2020-10-20 00:00:18,342 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 362 transitions. Word has length 27 [2020-10-20 00:00:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:18,343 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 362 transitions. [2020-10-20 00:00:18,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:00:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 362 transitions. [2020-10-20 00:00:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-20 00:00:18,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:18,345 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:18,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:18,559 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1176409765, now seen corresponding path program 1 times [2020-10-20 00:00:18,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:18,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997158100] [2020-10-20 00:00:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 00:00:18,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997158100] [2020-10-20 00:00:18,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:00:18,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:00:18,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365523737] [2020-10-20 00:00:18,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:00:18,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:18,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:00:18,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:18,599 INFO L87 Difference]: Start difference. First operand 224 states and 362 transitions. Second operand 3 states. [2020-10-20 00:00:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:18,632 INFO L93 Difference]: Finished difference Result 409 states and 661 transitions. [2020-10-20 00:00:18,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:00:18,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-20 00:00:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:18,635 INFO L225 Difference]: With dead ends: 409 [2020-10-20 00:00:18,635 INFO L226 Difference]: Without dead ends: 211 [2020-10-20 00:00:18,636 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 00:00:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-20 00:00:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2020-10-20 00:00:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-20 00:00:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 330 transitions. [2020-10-20 00:00:18,643 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 330 transitions. Word has length 28 [2020-10-20 00:00:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:18,644 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 330 transitions. [2020-10-20 00:00:18,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:00:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 330 transitions. [2020-10-20 00:00:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-20 00:00:18,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:18,645 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:18,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 00:00:18,645 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:18,646 INFO L82 PathProgramCache]: Analyzing trace with hash 989407566, now seen corresponding path program 1 times [2020-10-20 00:00:18,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:18,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576195017] [2020-10-20 00:00:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 00:00:18,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576195017] [2020-10-20 00:00:18,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:00:18,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:00:18,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866161470] [2020-10-20 00:00:18,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:00:18,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:18,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:00:18,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:18,693 INFO L87 Difference]: Start difference. First operand 209 states and 330 transitions. Second operand 3 states. [2020-10-20 00:00:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:18,752 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2020-10-20 00:00:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:00:18,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-20 00:00:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:18,754 INFO L225 Difference]: With dead ends: 375 [2020-10-20 00:00:18,754 INFO L226 Difference]: Without dead ends: 211 [2020-10-20 00:00:18,755 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 00:00:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-20 00:00:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2020-10-20 00:00:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-20 00:00:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2020-10-20 00:00:18,762 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 36 [2020-10-20 00:00:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:18,762 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2020-10-20 00:00:18,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:00:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2020-10-20 00:00:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-20 00:00:18,764 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:18,764 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 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 00:00:18,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 00:00:18,765 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:18,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:18,765 INFO L82 PathProgramCache]: Analyzing trace with hash -936850633, now seen corresponding path program 1 times [2020-10-20 00:00:18,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:18,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805892497] [2020-10-20 00:00:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:18,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805892497] [2020-10-20 00:00:18,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025561902] [2020-10-20 00:00:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:19,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 00:00:19,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 00:00:19,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:19,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-10-20 00:00:19,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919764971] [2020-10-20 00:00:19,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 00:00:19,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 00:00:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:00:19,103 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 7 states. [2020-10-20 00:00:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:19,649 INFO L93 Difference]: Finished difference Result 490 states and 766 transitions. [2020-10-20 00:00:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 00:00:19,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-10-20 00:00:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:19,651 INFO L225 Difference]: With dead ends: 490 [2020-10-20 00:00:19,651 INFO L226 Difference]: Without dead ends: 275 [2020-10-20 00:00:19,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-20 00:00:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-10-20 00:00:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 260. [2020-10-20 00:00:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-10-20 00:00:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 406 transitions. [2020-10-20 00:00:19,662 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 406 transitions. Word has length 37 [2020-10-20 00:00:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:19,663 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 406 transitions. [2020-10-20 00:00:19,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 00:00:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 406 transitions. [2020-10-20 00:00:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-20 00:00:19,664 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:19,664 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2020-10-20 00:00:19,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-20 00:00:19,878 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:19,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:19,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1033847947, now seen corresponding path program 1 times [2020-10-20 00:00:19,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:19,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098065561] [2020-10-20 00:00:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 00:00:19,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098065561] [2020-10-20 00:00:19,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490785] [2020-10-20 00:00:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:20,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 00:00:20,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 00:00:20,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:20,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-20 00:00:20,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99576884] [2020-10-20 00:00:20,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:00:20,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:20,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:00:20,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:00:20,131 INFO L87 Difference]: Start difference. First operand 260 states and 406 transitions. Second operand 4 states. [2020-10-20 00:00:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:20,281 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2020-10-20 00:00:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:00:20,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-10-20 00:00:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:20,285 INFO L225 Difference]: With dead ends: 274 [2020-10-20 00:00:20,285 INFO L226 Difference]: Without dead ends: 262 [2020-10-20 00:00:20,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:00:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-10-20 00:00:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2020-10-20 00:00:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-10-20 00:00:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2020-10-20 00:00:20,297 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 38 [2020-10-20 00:00:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:20,298 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2020-10-20 00:00:20,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:00:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2020-10-20 00:00:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-10-20 00:00:20,299 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:20,299 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2020-10-20 00:00:20,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:20,513 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1756734972, now seen corresponding path program 1 times [2020-10-20 00:00:20,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:20,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818083143] [2020-10-20 00:00:20,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:20,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818083143] [2020-10-20 00:00:20,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310559326] [2020-10-20 00:00:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:20,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 00:00:20,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:20,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:20,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 00:00:20,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249005293] [2020-10-20 00:00:20,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 00:00:20,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:20,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 00:00:20,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:00:20,910 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 6 states. [2020-10-20 00:00:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:21,094 INFO L93 Difference]: Finished difference Result 271 states and 402 transitions. [2020-10-20 00:00:21,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:00:21,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-10-20 00:00:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:21,097 INFO L225 Difference]: With dead ends: 271 [2020-10-20 00:00:21,097 INFO L226 Difference]: Without dead ends: 269 [2020-10-20 00:00:21,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:00:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-10-20 00:00:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 261. [2020-10-20 00:00:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2020-10-20 00:00:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2020-10-20 00:00:21,107 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 40 [2020-10-20 00:00:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:21,107 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2020-10-20 00:00:21,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 00:00:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2020-10-20 00:00:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-20 00:00:21,108 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:21,108 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2020-10-20 00:00:21,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-10-20 00:00:21,322 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:21,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1250552987, now seen corresponding path program 1 times [2020-10-20 00:00:21,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:21,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246741164] [2020-10-20 00:00:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 00:00:21,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246741164] [2020-10-20 00:00:21,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:00:21,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:00:21,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567224578] [2020-10-20 00:00:21,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:00:21,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:00:21,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:21,362 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 3 states. [2020-10-20 00:00:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:21,394 INFO L93 Difference]: Finished difference Result 461 states and 699 transitions. [2020-10-20 00:00:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:00:21,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-10-20 00:00:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:21,396 INFO L225 Difference]: With dead ends: 461 [2020-10-20 00:00:21,396 INFO L226 Difference]: Without dead ends: 245 [2020-10-20 00:00:21,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-20 00:00:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2020-10-20 00:00:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2020-10-20 00:00:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 360 transitions. [2020-10-20 00:00:21,404 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 360 transitions. Word has length 41 [2020-10-20 00:00:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:21,405 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 360 transitions. [2020-10-20 00:00:21,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:00:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 360 transitions. [2020-10-20 00:00:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-20 00:00:21,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:21,406 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2020-10-20 00:00:21,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 00:00:21,406 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:21,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1789960589, now seen corresponding path program 1 times [2020-10-20 00:00:21,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:21,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44635058] [2020-10-20 00:00:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-10-20 00:00:21,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44635058] [2020-10-20 00:00:21,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:00:21,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:00:21,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216198426] [2020-10-20 00:00:21,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:00:21,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:21,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:00:21,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:00:21,463 INFO L87 Difference]: Start difference. First operand 243 states and 360 transitions. Second operand 3 states. [2020-10-20 00:00:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:21,493 INFO L93 Difference]: Finished difference Result 333 states and 494 transitions. [2020-10-20 00:00:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:00:21,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-10-20 00:00:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:21,496 INFO L225 Difference]: With dead ends: 333 [2020-10-20 00:00:21,496 INFO L226 Difference]: Without dead ends: 155 [2020-10-20 00:00:21,497 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 00:00:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-20 00:00:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2020-10-20 00:00:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-20 00:00:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2020-10-20 00:00:21,502 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 51 [2020-10-20 00:00:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:21,502 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2020-10-20 00:00:21,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:00:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2020-10-20 00:00:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-20 00:00:21,503 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:21,503 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2020-10-20 00:00:21,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 00:00:21,503 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash -608000180, now seen corresponding path program 1 times [2020-10-20 00:00:21,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:21,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985705085] [2020-10-20 00:00:21,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 00:00:21,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985705085] [2020-10-20 00:00:21,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505667461] [2020-10-20 00:00:21,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:21,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 00:00:21,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-20 00:00:21,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:21,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 00:00:21,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170367743] [2020-10-20 00:00:21,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:00:21,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:21,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:00:21,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:00:21,730 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 5 states. [2020-10-20 00:00:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:21,825 INFO L93 Difference]: Finished difference Result 286 states and 418 transitions. [2020-10-20 00:00:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 00:00:21,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2020-10-20 00:00:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:21,828 INFO L225 Difference]: With dead ends: 286 [2020-10-20 00:00:21,828 INFO L226 Difference]: Without dead ends: 194 [2020-10-20 00:00:21,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:00:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-20 00:00:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2020-10-20 00:00:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-10-20 00:00:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2020-10-20 00:00:21,835 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 52 [2020-10-20 00:00:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:21,836 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2020-10-20 00:00:21,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:00:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2020-10-20 00:00:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-10-20 00:00:21,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:21,837 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2020-10-20 00:00:22,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:22,052 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:22,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1903289774, now seen corresponding path program 1 times [2020-10-20 00:00:22,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:22,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541391958] [2020-10-20 00:00:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:22,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541391958] [2020-10-20 00:00:22,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321764878] [2020-10-20 00:00:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:22,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 00:00:22,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:22,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:22,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 00:00:22,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895551583] [2020-10-20 00:00:22,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 00:00:22,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 00:00:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:00:22,339 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand 7 states. [2020-10-20 00:00:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:22,444 INFO L93 Difference]: Finished difference Result 193 states and 274 transitions. [2020-10-20 00:00:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:00:22,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-10-20 00:00:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:22,446 INFO L225 Difference]: With dead ends: 193 [2020-10-20 00:00:22,446 INFO L226 Difference]: Without dead ends: 191 [2020-10-20 00:00:22,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:00:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-10-20 00:00:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2020-10-20 00:00:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-10-20 00:00:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 272 transitions. [2020-10-20 00:00:22,455 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 272 transitions. Word has length 56 [2020-10-20 00:00:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:22,455 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 272 transitions. [2020-10-20 00:00:22,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 00:00:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 272 transitions. [2020-10-20 00:00:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 00:00:22,456 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:22,456 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 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] [2020-10-20 00:00:22,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-10-20 00:00:22,657 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:22,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:22,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1029731011, now seen corresponding path program 1 times [2020-10-20 00:00:22,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:22,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893518208] [2020-10-20 00:00:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:22,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893518208] [2020-10-20 00:00:22,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908732711] [2020-10-20 00:00:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:23,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-20 00:00:23,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:23,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:23,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-10-20 00:00:23,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452285433] [2020-10-20 00:00:23,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 00:00:23,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:23,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 00:00:23,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-20 00:00:23,095 INFO L87 Difference]: Start difference. First operand 191 states and 272 transitions. Second operand 8 states. [2020-10-20 00:00:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:23,213 INFO L93 Difference]: Finished difference Result 196 states and 276 transitions. [2020-10-20 00:00:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 00:00:23,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-10-20 00:00:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:23,215 INFO L225 Difference]: With dead ends: 196 [2020-10-20 00:00:23,216 INFO L226 Difference]: Without dead ends: 194 [2020-10-20 00:00:23,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-20 00:00:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-20 00:00:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2020-10-20 00:00:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-10-20 00:00:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 273 transitions. [2020-10-20 00:00:23,223 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 273 transitions. Word has length 63 [2020-10-20 00:00:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:23,224 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 273 transitions. [2020-10-20 00:00:23,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 00:00:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 273 transitions. [2020-10-20 00:00:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-20 00:00:23,224 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:23,225 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 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] [2020-10-20 00:00:23,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-10-20 00:00:23,439 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:23,439 INFO L82 PathProgramCache]: Analyzing trace with hash 531523283, now seen corresponding path program 1 times [2020-10-20 00:00:23,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:23,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342421417] [2020-10-20 00:00:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 70 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 00:00:23,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342421417] [2020-10-20 00:00:23,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619235814] [2020-10-20 00:00:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:23,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 00:00:23,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:23,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:23,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-10-20 00:00:23,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120857463] [2020-10-20 00:00:23,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 00:00:23,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:23,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 00:00:23,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:00:23,930 INFO L87 Difference]: Start difference. First operand 192 states and 273 transitions. Second operand 12 states. [2020-10-20 00:00:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:24,138 INFO L93 Difference]: Finished difference Result 301 states and 437 transitions. [2020-10-20 00:00:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:00:24,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-20 00:00:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:24,140 INFO L225 Difference]: With dead ends: 301 [2020-10-20 00:00:24,140 INFO L226 Difference]: Without dead ends: 211 [2020-10-20 00:00:24,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-20 00:00:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-20 00:00:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2020-10-20 00:00:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-20 00:00:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2020-10-20 00:00:24,147 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 73 [2020-10-20 00:00:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:24,147 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2020-10-20 00:00:24,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 00:00:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2020-10-20 00:00:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-20 00:00:24,153 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:24,154 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 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] [2020-10-20 00:00:24,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-20 00:00:24,367 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 833926246, now seen corresponding path program 1 times [2020-10-20 00:00:24,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:24,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191260072] [2020-10-20 00:00:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 105 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 00:00:24,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191260072] [2020-10-20 00:00:24,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341936258] [2020-10-20 00:00:24,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:24,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 00:00:24,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-20 00:00:24,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:24,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-10-20 00:00:24,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683811257] [2020-10-20 00:00:24,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 00:00:24,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:24,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 00:00:24,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:00:24,792 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand 9 states. [2020-10-20 00:00:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:25,039 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2020-10-20 00:00:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:00:25,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2020-10-20 00:00:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:25,041 INFO L225 Difference]: With dead ends: 329 [2020-10-20 00:00:25,042 INFO L226 Difference]: Without dead ends: 239 [2020-10-20 00:00:25,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-20 00:00:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-10-20 00:00:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2020-10-20 00:00:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-20 00:00:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 325 transitions. [2020-10-20 00:00:25,050 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 325 transitions. Word has length 83 [2020-10-20 00:00:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:25,050 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 325 transitions. [2020-10-20 00:00:25,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 00:00:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 325 transitions. [2020-10-20 00:00:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-10-20 00:00:25,051 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:25,051 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:25,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:25,267 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:25,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash -112559507, now seen corresponding path program 1 times [2020-10-20 00:00:25,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:25,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465543430] [2020-10-20 00:00:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 110 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 00:00:25,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465543430] [2020-10-20 00:00:25,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873723988] [2020-10-20 00:00:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:25,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 29 conjunts are in the unsatisfiable core [2020-10-20 00:00:25,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:25,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:25,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2020-10-20 00:00:25,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938838994] [2020-10-20 00:00:25,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 00:00:25,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:25,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 00:00:25,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-10-20 00:00:25,745 INFO L87 Difference]: Start difference. First operand 230 states and 325 transitions. Second operand 13 states. [2020-10-20 00:00:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:26,113 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2020-10-20 00:00:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:00:26,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2020-10-20 00:00:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:26,116 INFO L225 Difference]: With dead ends: 233 [2020-10-20 00:00:26,116 INFO L226 Difference]: Without dead ends: 231 [2020-10-20 00:00:26,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:00:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-10-20 00:00:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2020-10-20 00:00:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-10-20 00:00:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2020-10-20 00:00:26,125 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 86 [2020-10-20 00:00:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:26,126 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2020-10-20 00:00:26,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 00:00:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2020-10-20 00:00:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-20 00:00:26,128 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:26,128 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:26,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:26,344 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash -141600195, now seen corresponding path program 1 times [2020-10-20 00:00:26,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:26,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907190500] [2020-10-20 00:00:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-20 00:00:26,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907190500] [2020-10-20 00:00:26,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245786202] [2020-10-20 00:00:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:26,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-20 00:00:26,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 24 proven. 148 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-20 00:00:26,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:26,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 00:00:26,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918924686] [2020-10-20 00:00:26,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 00:00:26,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:26,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 00:00:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:00:26,674 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 7 states. [2020-10-20 00:00:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:26,858 INFO L93 Difference]: Finished difference Result 364 states and 525 transitions. [2020-10-20 00:00:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 00:00:26,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2020-10-20 00:00:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:26,860 INFO L225 Difference]: With dead ends: 364 [2020-10-20 00:00:26,860 INFO L226 Difference]: Without dead ends: 272 [2020-10-20 00:00:26,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 00:00:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-20 00:00:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2020-10-20 00:00:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-10-20 00:00:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 380 transitions. [2020-10-20 00:00:26,868 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 380 transitions. Word has length 98 [2020-10-20 00:00:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:26,868 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 380 transitions. [2020-10-20 00:00:26,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 00:00:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 380 transitions. [2020-10-20 00:00:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-20 00:00:26,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:26,869 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:27,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:27,084 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:27,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:27,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1596344289, now seen corresponding path program 1 times [2020-10-20 00:00:27,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:27,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951942219] [2020-10-20 00:00:27,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 160 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 00:00:27,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951942219] [2020-10-20 00:00:27,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485897847] [2020-10-20 00:00:27,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:27,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-20 00:00:27,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 24 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:27,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:27,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2020-10-20 00:00:27,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214556786] [2020-10-20 00:00:27,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 00:00:27,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:27,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 00:00:27,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:00:27,681 INFO L87 Difference]: Start difference. First operand 269 states and 380 transitions. Second operand 14 states. [2020-10-20 00:00:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:28,092 INFO L93 Difference]: Finished difference Result 271 states and 381 transitions. [2020-10-20 00:00:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 00:00:28,092 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2020-10-20 00:00:28,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:28,094 INFO L225 Difference]: With dead ends: 271 [2020-10-20 00:00:28,095 INFO L226 Difference]: Without dead ends: 269 [2020-10-20 00:00:28,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:00:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-10-20 00:00:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2020-10-20 00:00:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-10-20 00:00:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 379 transitions. [2020-10-20 00:00:28,107 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 379 transitions. Word has length 102 [2020-10-20 00:00:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:28,107 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 379 transitions. [2020-10-20 00:00:28,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 00:00:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 379 transitions. [2020-10-20 00:00:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-10-20 00:00:28,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:28,110 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:28,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-10-20 00:00:28,323 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash -850579662, now seen corresponding path program 2 times [2020-10-20 00:00:28,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:28,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636148316] [2020-10-20 00:00:28,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 198 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-20 00:00:28,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636148316] [2020-10-20 00:00:28,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841641482] [2020-10-20 00:00:28,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:28,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:00:28,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:28,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 37 conjunts are in the unsatisfiable core [2020-10-20 00:00:28,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 27 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:28,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:28,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2020-10-20 00:00:28,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310244820] [2020-10-20 00:00:28,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 00:00:28,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:28,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 00:00:28,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2020-10-20 00:00:28,969 INFO L87 Difference]: Start difference. First operand 269 states and 379 transitions. Second operand 16 states. [2020-10-20 00:00:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:29,335 INFO L93 Difference]: Finished difference Result 274 states and 383 transitions. [2020-10-20 00:00:29,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 00:00:29,336 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2020-10-20 00:00:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:29,340 INFO L225 Difference]: With dead ends: 274 [2020-10-20 00:00:29,340 INFO L226 Difference]: Without dead ends: 272 [2020-10-20 00:00:29,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-10-20 00:00:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-10-20 00:00:29,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2020-10-20 00:00:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-10-20 00:00:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 380 transitions. [2020-10-20 00:00:29,349 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 380 transitions. Word has length 109 [2020-10-20 00:00:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:29,350 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 380 transitions. [2020-10-20 00:00:29,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 00:00:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 380 transitions. [2020-10-20 00:00:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-10-20 00:00:29,352 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:29,352 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-20 00:00:29,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:29,577 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:29,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash 990487682, now seen corresponding path program 2 times [2020-10-20 00:00:29,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:29,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322353926] [2020-10-20 00:00:29,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-20 00:00:29,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322353926] [2020-10-20 00:00:29,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254398702] [2020-10-20 00:00:29,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:29,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:00:29,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:29,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-20 00:00:29,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:30,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:30,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2020-10-20 00:00:30,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141416955] [2020-10-20 00:00:30,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-20 00:00:30,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-20 00:00:30,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-10-20 00:00:30,168 INFO L87 Difference]: Start difference. First operand 270 states and 380 transitions. Second operand 18 states. [2020-10-20 00:00:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:30,553 INFO L93 Difference]: Finished difference Result 379 states and 544 transitions. [2020-10-20 00:00:30,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 00:00:30,553 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 119 [2020-10-20 00:00:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:30,556 INFO L225 Difference]: With dead ends: 379 [2020-10-20 00:00:30,557 INFO L226 Difference]: Without dead ends: 289 [2020-10-20 00:00:30,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2020-10-20 00:00:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-10-20 00:00:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2020-10-20 00:00:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2020-10-20 00:00:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2020-10-20 00:00:30,565 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 119 [2020-10-20 00:00:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:30,566 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2020-10-20 00:00:30,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-20 00:00:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2020-10-20 00:00:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-20 00:00:30,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:30,567 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-20 00:00:30,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-10-20 00:00:30,781 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1581114197, now seen corresponding path program 2 times [2020-10-20 00:00:30,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:30,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836348324] [2020-10-20 00:00:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 304 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-20 00:00:31,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836348324] [2020-10-20 00:00:31,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904460562] [2020-10-20 00:00:31,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:31,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:00:31,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:31,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-20 00:00:31,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 33 proven. 298 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-20 00:00:31,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:31,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-10-20 00:00:31,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636402098] [2020-10-20 00:00:31,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 00:00:31,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:31,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 00:00:31,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-20 00:00:31,407 INFO L87 Difference]: Start difference. First operand 289 states and 406 transitions. Second operand 11 states. [2020-10-20 00:00:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:31,835 INFO L93 Difference]: Finished difference Result 408 states and 578 transitions. [2020-10-20 00:00:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 00:00:31,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2020-10-20 00:00:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:31,839 INFO L225 Difference]: With dead ends: 408 [2020-10-20 00:00:31,839 INFO L226 Difference]: Without dead ends: 318 [2020-10-20 00:00:31,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:00:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-10-20 00:00:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 308. [2020-10-20 00:00:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-10-20 00:00:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2020-10-20 00:00:31,854 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 129 [2020-10-20 00:00:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:31,855 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2020-10-20 00:00:31,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 00:00:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2020-10-20 00:00:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-20 00:00:31,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:31,858 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:32,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:32,072 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:32,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:32,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1451806434, now seen corresponding path program 2 times [2020-10-20 00:00:32,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:32,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169793340] [2020-10-20 00:00:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 314 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-20 00:00:32,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169793340] [2020-10-20 00:00:32,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527006303] [2020-10-20 00:00:32,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:32,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:00:32,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:32,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 45 conjunts are in the unsatisfiable core [2020-10-20 00:00:32,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 33 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:33,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:33,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 19 [2020-10-20 00:00:33,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376871238] [2020-10-20 00:00:33,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-20 00:00:33,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:33,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-20 00:00:33,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2020-10-20 00:00:33,171 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand 19 states. [2020-10-20 00:00:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:33,536 INFO L93 Difference]: Finished difference Result 311 states and 435 transitions. [2020-10-20 00:00:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 00:00:33,537 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 132 [2020-10-20 00:00:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:33,538 INFO L225 Difference]: With dead ends: 311 [2020-10-20 00:00:33,539 INFO L226 Difference]: Without dead ends: 309 [2020-10-20 00:00:33,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2020-10-20 00:00:33,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-10-20 00:00:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2020-10-20 00:00:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-10-20 00:00:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 433 transitions. [2020-10-20 00:00:33,550 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 433 transitions. Word has length 132 [2020-10-20 00:00:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:33,550 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 433 transitions. [2020-10-20 00:00:33,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-20 00:00:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 433 transitions. [2020-10-20 00:00:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-20 00:00:33,552 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:33,552 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:33,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-10-20 00:00:33,765 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash -722301074, now seen corresponding path program 2 times [2020-10-20 00:00:33,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:33,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450704291] [2020-10-20 00:00:33,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-20 00:00:34,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450704291] [2020-10-20 00:00:34,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465915134] [2020-10-20 00:00:34,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:34,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:00:34,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:34,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 26 conjunts are in the unsatisfiable core [2020-10-20 00:00:34,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 379 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-20 00:00:34,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:34,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-20 00:00:34,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793485443] [2020-10-20 00:00:34,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 00:00:34,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:34,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 00:00:34,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:00:34,275 INFO L87 Difference]: Start difference. First operand 309 states and 433 transitions. Second operand 9 states. [2020-10-20 00:00:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:34,536 INFO L93 Difference]: Finished difference Result 442 states and 632 transitions. [2020-10-20 00:00:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 00:00:34,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2020-10-20 00:00:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:34,539 INFO L225 Difference]: With dead ends: 442 [2020-10-20 00:00:34,539 INFO L226 Difference]: Without dead ends: 350 [2020-10-20 00:00:34,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-20 00:00:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-10-20 00:00:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2020-10-20 00:00:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-10-20 00:00:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 487 transitions. [2020-10-20 00:00:34,552 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 487 transitions. Word has length 144 [2020-10-20 00:00:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:34,552 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 487 transitions. [2020-10-20 00:00:34,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 00:00:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 487 transitions. [2020-10-20 00:00:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-10-20 00:00:34,555 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:34,556 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:34,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-20 00:00:34,769 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:34,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:34,770 INFO L82 PathProgramCache]: Analyzing trace with hash 38595792, now seen corresponding path program 2 times [2020-10-20 00:00:34,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:34,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812938908] [2020-10-20 00:00:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 397 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-20 00:00:35,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812938908] [2020-10-20 00:00:35,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979140503] [2020-10-20 00:00:35,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:35,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:00:35,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:35,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 37 conjunts are in the unsatisfiable core [2020-10-20 00:00:35,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:00:35,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:35,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2020-10-20 00:00:35,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061715849] [2020-10-20 00:00:35,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-20 00:00:35,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:35,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-20 00:00:35,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2020-10-20 00:00:35,495 INFO L87 Difference]: Start difference. First operand 347 states and 487 transitions. Second operand 20 states. [2020-10-20 00:00:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:35,978 INFO L93 Difference]: Finished difference Result 349 states and 488 transitions. [2020-10-20 00:00:35,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 00:00:35,978 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 148 [2020-10-20 00:00:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:35,983 INFO L225 Difference]: With dead ends: 349 [2020-10-20 00:00:35,983 INFO L226 Difference]: Without dead ends: 347 [2020-10-20 00:00:35,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2020-10-20 00:00:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-10-20 00:00:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2020-10-20 00:00:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-10-20 00:00:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 486 transitions. [2020-10-20 00:00:35,994 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 486 transitions. Word has length 148 [2020-10-20 00:00:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:35,994 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 486 transitions. [2020-10-20 00:00:35,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-20 00:00:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 486 transitions. [2020-10-20 00:00:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-10-20 00:00:35,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:35,996 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:36,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-20 00:00:36,209 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash 71795041, now seen corresponding path program 3 times [2020-10-20 00:00:36,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:36,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390481681] [2020-10-20 00:00:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 39 proven. 454 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-20 00:00:36,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390481681] [2020-10-20 00:00:36,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646112753] [2020-10-20 00:00:36,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:36,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-10-20 00:00:36,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:36,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-20 00:00:36,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 248 proven. 32 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2020-10-20 00:00:36,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:36,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2020-10-20 00:00:36,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201121282] [2020-10-20 00:00:36,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-20 00:00:36,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:36,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-20 00:00:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-10-20 00:00:36,973 INFO L87 Difference]: Start difference. First operand 347 states and 486 transitions. Second operand 16 states. [2020-10-20 00:00:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:38,390 INFO L93 Difference]: Finished difference Result 544 states and 765 transitions. [2020-10-20 00:00:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-10-20 00:00:38,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 155 [2020-10-20 00:00:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:38,393 INFO L225 Difference]: With dead ends: 544 [2020-10-20 00:00:38,393 INFO L226 Difference]: Without dead ends: 448 [2020-10-20 00:00:38,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=1330, Unknown=0, NotChecked=0, Total=1482 [2020-10-20 00:00:38,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-20 00:00:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 425. [2020-10-20 00:00:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2020-10-20 00:00:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 598 transitions. [2020-10-20 00:00:38,406 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 598 transitions. Word has length 155 [2020-10-20 00:00:38,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:38,407 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 598 transitions. [2020-10-20 00:00:38,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-20 00:00:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 598 transitions. [2020-10-20 00:00:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-10-20 00:00:38,409 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:38,409 INFO L422 BasicCegarLoop]: trace histogram [15, 14, 14, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:38,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-10-20 00:00:38,622 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:38,623 INFO L82 PathProgramCache]: Analyzing trace with hash 808412595, now seen corresponding path program 1 times [2020-10-20 00:00:38,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:38,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160037517] [2020-10-20 00:00:38,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-20 00:00:38,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160037517] [2020-10-20 00:00:38,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259150274] [2020-10-20 00:00:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:38,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-20 00:00:38,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 98 proven. 470 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-20 00:00:38,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:38,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-10-20 00:00:38,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584961964] [2020-10-20 00:00:38,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 00:00:38,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 00:00:38,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 00:00:38,998 INFO L87 Difference]: Start difference. First operand 425 states and 598 transitions. Second operand 11 states. [2020-10-20 00:00:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:39,187 INFO L93 Difference]: Finished difference Result 927 states and 1318 transitions. [2020-10-20 00:00:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:00:39,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2020-10-20 00:00:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:39,192 INFO L225 Difference]: With dead ends: 927 [2020-10-20 00:00:39,193 INFO L226 Difference]: Without dead ends: 760 [2020-10-20 00:00:39,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 00:00:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2020-10-20 00:00:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 719. [2020-10-20 00:00:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2020-10-20 00:00:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1011 transitions. [2020-10-20 00:00:39,211 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1011 transitions. Word has length 165 [2020-10-20 00:00:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:39,212 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1011 transitions. [2020-10-20 00:00:39,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 00:00:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1011 transitions. [2020-10-20 00:00:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-10-20 00:00:39,213 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:39,214 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:39,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:39,430 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1110215403, now seen corresponding path program 1 times [2020-10-20 00:00:39,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:39,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923909561] [2020-10-20 00:00:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 526 proven. 136 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-20 00:00:39,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923909561] [2020-10-20 00:00:39,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375887181] [2020-10-20 00:00:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:39,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 00:00:39,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-20 00:00:40,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 00:00:40,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2020-10-20 00:00:40,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692033871] [2020-10-20 00:00:40,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 00:00:40,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:40,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 00:00:40,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:00:40,081 INFO L87 Difference]: Start difference. First operand 719 states and 1011 transitions. Second operand 10 states. [2020-10-20 00:00:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:40,251 INFO L93 Difference]: Finished difference Result 860 states and 1208 transitions. [2020-10-20 00:00:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:00:40,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-10-20 00:00:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:40,256 INFO L225 Difference]: With dead ends: 860 [2020-10-20 00:00:40,256 INFO L226 Difference]: Without dead ends: 856 [2020-10-20 00:00:40,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:00:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2020-10-20 00:00:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 852. [2020-10-20 00:00:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-10-20 00:00:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1200 transitions. [2020-10-20 00:00:40,276 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1200 transitions. Word has length 177 [2020-10-20 00:00:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:40,277 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1200 transitions. [2020-10-20 00:00:40,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 00:00:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1200 transitions. [2020-10-20 00:00:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-10-20 00:00:40,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:40,279 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:40,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:40,494 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash -45491697, now seen corresponding path program 3 times [2020-10-20 00:00:40,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:40,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020013720] [2020-10-20 00:00:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 45 proven. 626 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-20 00:00:40,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020013720] [2020-10-20 00:00:40,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465217419] [2020-10-20 00:00:40,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:41,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-10-20 00:00:41,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:41,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 30 conjunts are in the unsatisfiable core [2020-10-20 00:00:41,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 665 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-20 00:00:41,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:41,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2020-10-20 00:00:41,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005683398] [2020-10-20 00:00:41,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-20 00:00:41,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:41,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-20 00:00:41,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2020-10-20 00:00:41,524 INFO L87 Difference]: Start difference. First operand 852 states and 1200 transitions. Second operand 22 states. [2020-10-20 00:00:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:42,057 INFO L93 Difference]: Finished difference Result 863 states and 1209 transitions. [2020-10-20 00:00:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-20 00:00:42,065 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 178 [2020-10-20 00:00:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:42,069 INFO L225 Difference]: With dead ends: 863 [2020-10-20 00:00:42,070 INFO L226 Difference]: Without dead ends: 861 [2020-10-20 00:00:42,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2020-10-20 00:00:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-10-20 00:00:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 852. [2020-10-20 00:00:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-10-20 00:00:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1199 transitions. [2020-10-20 00:00:42,095 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1199 transitions. Word has length 178 [2020-10-20 00:00:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:42,096 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 1199 transitions. [2020-10-20 00:00:42,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-20 00:00:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1199 transitions. [2020-10-20 00:00:42,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-10-20 00:00:42,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:42,099 INFO L422 BasicCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:42,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-10-20 00:00:42,315 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1121314851, now seen corresponding path program 1 times [2020-10-20 00:00:42,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:42,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868647972] [2020-10-20 00:00:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-20 00:00:42,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868647972] [2020-10-20 00:00:42,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658331723] [2020-10-20 00:00:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:42,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 00:00:42,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-20 00:00:42,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:42,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-10-20 00:00:42,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492559025] [2020-10-20 00:00:42,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 00:00:42,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:42,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 00:00:42,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:00:42,787 INFO L87 Difference]: Start difference. First operand 852 states and 1199 transitions. Second operand 12 states. [2020-10-20 00:00:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:43,031 INFO L93 Difference]: Finished difference Result 1435 states and 2015 transitions. [2020-10-20 00:00:43,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 00:00:43,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 193 [2020-10-20 00:00:43,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:43,036 INFO L225 Difference]: With dead ends: 1435 [2020-10-20 00:00:43,037 INFO L226 Difference]: Without dead ends: 959 [2020-10-20 00:00:43,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 00:00:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-10-20 00:00:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 930. [2020-10-20 00:00:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-10-20 00:00:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1311 transitions. [2020-10-20 00:00:43,060 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1311 transitions. Word has length 193 [2020-10-20 00:00:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:43,060 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1311 transitions. [2020-10-20 00:00:43,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 00:00:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1311 transitions. [2020-10-20 00:00:43,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-20 00:00:43,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:43,062 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:43,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:43,275 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash -608595007, now seen corresponding path program 3 times [2020-10-20 00:00:43,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:43,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605281800] [2020-10-20 00:00:43,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 48 proven. 742 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-20 00:00:43,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605281800] [2020-10-20 00:00:43,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493728741] [2020-10-20 00:00:43,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:43,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2020-10-20 00:00:43,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:43,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-20 00:00:43,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 771 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-10-20 00:00:44,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:44,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2020-10-20 00:00:44,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188374405] [2020-10-20 00:00:44,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-20 00:00:44,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:44,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-20 00:00:44,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-10-20 00:00:44,191 INFO L87 Difference]: Start difference. First operand 930 states and 1311 transitions. Second operand 24 states. [2020-10-20 00:00:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:44,791 INFO L93 Difference]: Finished difference Result 938 states and 1317 transitions. [2020-10-20 00:00:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-20 00:00:44,792 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 194 [2020-10-20 00:00:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:44,796 INFO L225 Difference]: With dead ends: 938 [2020-10-20 00:00:44,796 INFO L226 Difference]: Without dead ends: 936 [2020-10-20 00:00:44,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2020-10-20 00:00:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2020-10-20 00:00:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 930. [2020-10-20 00:00:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-10-20 00:00:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1309 transitions. [2020-10-20 00:00:44,814 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1309 transitions. Word has length 194 [2020-10-20 00:00:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:44,814 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1309 transitions. [2020-10-20 00:00:44,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-20 00:00:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1309 transitions. [2020-10-20 00:00:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-10-20 00:00:44,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:44,816 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 13, 13, 8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:45,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-10-20 00:00:45,023 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2110169374, now seen corresponding path program 2 times [2020-10-20 00:00:45,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:45,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078229124] [2020-10-20 00:00:45,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-20 00:00:45,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078229124] [2020-10-20 00:00:45,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799338517] [2020-10-20 00:00:45,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:45,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:00:45,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:45,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 00:00:45,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 128 proven. 842 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-20 00:00:45,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:45,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-10-20 00:00:45,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007759808] [2020-10-20 00:00:45,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 00:00:45,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:45,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 00:00:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-20 00:00:45,576 INFO L87 Difference]: Start difference. First operand 930 states and 1309 transitions. Second operand 13 states. [2020-10-20 00:00:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:45,813 INFO L93 Difference]: Finished difference Result 1125 states and 1564 transitions. [2020-10-20 00:00:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 00:00:45,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 211 [2020-10-20 00:00:45,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:45,819 INFO L225 Difference]: With dead ends: 1125 [2020-10-20 00:00:45,819 INFO L226 Difference]: Without dead ends: 1040 [2020-10-20 00:00:45,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-10-20 00:00:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2020-10-20 00:00:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1008. [2020-10-20 00:00:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2020-10-20 00:00:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1416 transitions. [2020-10-20 00:00:45,845 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1416 transitions. Word has length 211 [2020-10-20 00:00:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:45,845 INFO L481 AbstractCegarLoop]: Abstraction has 1008 states and 1416 transitions. [2020-10-20 00:00:45,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 00:00:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1416 transitions. [2020-10-20 00:00:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2020-10-20 00:00:45,848 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:45,848 INFO L422 BasicCegarLoop]: trace histogram [21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:46,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-10-20 00:00:46,057 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:46,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:46,057 INFO L82 PathProgramCache]: Analyzing trace with hash -397716270, now seen corresponding path program 2 times [2020-10-20 00:00:46,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:46,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47084286] [2020-10-20 00:00:46,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-20 00:00:46,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47084286] [2020-10-20 00:00:46,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084188667] [2020-10-20 00:00:46,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:46,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 00:00:46,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:46,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-20 00:00:46,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 159 proven. 1078 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-10-20 00:00:46,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:46,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2020-10-20 00:00:46,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155689472] [2020-10-20 00:00:46,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 00:00:46,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:46,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 00:00:46,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:00:46,669 INFO L87 Difference]: Start difference. First operand 1008 states and 1416 transitions. Second operand 14 states. [2020-10-20 00:00:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:46,940 INFO L93 Difference]: Finished difference Result 1675 states and 2346 transitions. [2020-10-20 00:00:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-20 00:00:46,941 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 239 [2020-10-20 00:00:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:46,946 INFO L225 Difference]: With dead ends: 1675 [2020-10-20 00:00:46,947 INFO L226 Difference]: Without dead ends: 1121 [2020-10-20 00:00:46,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:00:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2020-10-20 00:00:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1086. [2020-10-20 00:00:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2020-10-20 00:00:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1527 transitions. [2020-10-20 00:00:46,973 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1527 transitions. Word has length 239 [2020-10-20 00:00:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:46,973 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1527 transitions. [2020-10-20 00:00:46,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 00:00:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1527 transitions. [2020-10-20 00:00:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2020-10-20 00:00:46,975 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:46,976 INFO L422 BasicCegarLoop]: trace histogram [23, 22, 22, 16, 16, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:47,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-10-20 00:00:47,190 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash 220503505, now seen corresponding path program 3 times [2020-10-20 00:00:47,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:47,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254690648] [2020-10-20 00:00:47,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-20 00:00:47,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254690648] [2020-10-20 00:00:47,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949279116] [2020-10-20 00:00:47,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:47,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2020-10-20 00:00:47,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:47,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 23 conjunts are in the unsatisfiable core [2020-10-20 00:00:47,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 158 proven. 1322 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-10-20 00:00:48,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:48,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2020-10-20 00:00:48,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766953374] [2020-10-20 00:00:48,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 00:00:48,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:48,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 00:00:48,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:00:48,051 INFO L87 Difference]: Start difference. First operand 1086 states and 1527 transitions. Second operand 15 states. [2020-10-20 00:00:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:48,380 INFO L93 Difference]: Finished difference Result 1287 states and 1786 transitions. [2020-10-20 00:00:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 00:00:48,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 257 [2020-10-20 00:00:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:48,386 INFO L225 Difference]: With dead ends: 1287 [2020-10-20 00:00:48,387 INFO L226 Difference]: Without dead ends: 1202 [2020-10-20 00:00:48,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:00:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-10-20 00:00:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1164. [2020-10-20 00:00:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1164 states. [2020-10-20 00:00:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1634 transitions. [2020-10-20 00:00:48,426 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1634 transitions. Word has length 257 [2020-10-20 00:00:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:48,427 INFO L481 AbstractCegarLoop]: Abstraction has 1164 states and 1634 transitions. [2020-10-20 00:00:48,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 00:00:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1634 transitions. [2020-10-20 00:00:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2020-10-20 00:00:48,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:48,431 INFO L422 BasicCegarLoop]: trace histogram [25, 24, 24, 18, 18, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:48,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-10-20 00:00:48,645 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash 530835265, now seen corresponding path program 3 times [2020-10-20 00:00:48,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:48,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679167847] [2020-10-20 00:00:48,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 193 proven. 1614 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2020-10-20 00:00:49,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679167847] [2020-10-20 00:00:49,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011790063] [2020-10-20 00:00:49,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:49,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-20 00:00:49,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:49,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 00:00:49,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 469 proven. 4 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2020-10-20 00:00:49,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:49,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2020-10-20 00:00:49,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069958183] [2020-10-20 00:00:49,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-20 00:00:49,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:49,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-20 00:00:49,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2020-10-20 00:00:49,433 INFO L87 Difference]: Start difference. First operand 1164 states and 1634 transitions. Second operand 19 states. [2020-10-20 00:00:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:50,348 INFO L93 Difference]: Finished difference Result 1316 states and 1835 transitions. [2020-10-20 00:00:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-20 00:00:50,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 285 [2020-10-20 00:00:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:50,352 INFO L225 Difference]: With dead ends: 1316 [2020-10-20 00:00:50,353 INFO L226 Difference]: Without dead ends: 684 [2020-10-20 00:00:50,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=514, Invalid=1208, Unknown=0, NotChecked=0, Total=1722 [2020-10-20 00:00:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2020-10-20 00:00:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 659. [2020-10-20 00:00:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2020-10-20 00:00:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2020-10-20 00:00:50,369 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 285 [2020-10-20 00:00:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:50,370 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2020-10-20 00:00:50,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-20 00:00:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2020-10-20 00:00:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2020-10-20 00:00:50,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:50,373 INFO L422 BasicCegarLoop]: trace histogram [31, 30, 30, 22, 22, 14, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:50,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-10-20 00:00:50,589 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:50,589 INFO L82 PathProgramCache]: Analyzing trace with hash -689263377, now seen corresponding path program 4 times [2020-10-20 00:00:50,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:50,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062941927] [2020-10-20 00:00:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:00:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-20 00:00:51,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062941927] [2020-10-20 00:00:51,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468543350] [2020-10-20 00:00:51,104 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:51,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 00:00:51,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 00:00:51,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 2069 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-20 00:00:51,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:00:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2894 backedges. 218 proven. 2606 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2020-10-20 00:00:51,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:00:51,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2020-10-20 00:00:51,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334852536] [2020-10-20 00:00:51,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-20 00:00:51,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:00:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-20 00:00:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2020-10-20 00:00:51,614 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 19 states. [2020-10-20 00:00:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:00:51,855 INFO L93 Difference]: Finished difference Result 865 states and 1192 transitions. [2020-10-20 00:00:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-20 00:00:51,856 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 349 [2020-10-20 00:00:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:00:51,860 INFO L225 Difference]: With dead ends: 865 [2020-10-20 00:00:51,860 INFO L226 Difference]: Without dead ends: 780 [2020-10-20 00:00:51,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2020-10-20 00:00:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-10-20 00:00:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 737. [2020-10-20 00:00:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2020-10-20 00:00:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1014 transitions. [2020-10-20 00:00:51,876 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1014 transitions. Word has length 349 [2020-10-20 00:00:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:00:51,876 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 1014 transitions. [2020-10-20 00:00:51,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-20 00:00:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1014 transitions. [2020-10-20 00:00:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2020-10-20 00:00:51,879 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:00:51,880 INFO L422 BasicCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:00:52,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:00:52,095 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:00:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:00:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash 49372446, now seen corresponding path program 5 times [2020-10-20 00:00:52,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:00:52,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831383143] [2020-10-20 00:00:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:00:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:00:53,462 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:00:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 00:00:54,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 00:00:54,685 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 00:00:54,686 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 00:00:54,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-20 00:00:55,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:00:55 BoogieIcfgContainer [2020-10-20 00:00:55,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:00:55,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:00:55,061 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:00:55,061 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:00:55,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:00:15" (3/4) ... [2020-10-20 00:00:55,067 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 00:00:55,410 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 00:00:55,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:00:55,413 INFO L168 Benchmark]: Toolchain (without parser) took 41383.89 ms. Allocated memory was 35.7 MB in the beginning and 300.9 MB in the end (delta: 265.3 MB). Free memory was 17.3 MB in the beginning and 90.4 MB in the end (delta: -73.1 MB). Peak memory consumption was 192.1 MB. Max. memory is 14.3 GB. [2020-10-20 00:00:55,414 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 34.6 MB. Free memory was 13.0 MB in the beginning and 13.0 MB in the end (delta: 45.8 kB). Peak memory consumption was 45.8 kB. Max. memory is 14.3 GB. [2020-10-20 00:00:55,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.18 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 16.5 MB in the beginning and 16.9 MB in the end (delta: -403.6 kB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:00:55,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.40 ms. Allocated memory was 44.0 MB in the beginning and 44.6 MB in the end (delta: 524.3 kB). Free memory was 16.9 MB in the beginning and 23.0 MB in the end (delta: -6.1 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:00:55,415 INFO L168 Benchmark]: Boogie Preprocessor took 57.26 ms. Allocated memory is still 44.6 MB. Free memory was 23.0 MB in the beginning and 19.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:00:55,416 INFO L168 Benchmark]: RCFGBuilder took 1145.55 ms. Allocated memory was 44.6 MB in the beginning and 47.2 MB in the end (delta: 2.6 MB). Free memory was 19.7 MB in the beginning and 13.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 11.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:00:55,416 INFO L168 Benchmark]: TraceAbstraction took 39187.49 ms. Allocated memory was 47.2 MB in the beginning and 300.9 MB in the end (delta: 253.8 MB). Free memory was 13.1 MB in the beginning and 145.6 MB in the end (delta: -132.5 MB). Peak memory consumption was 259.0 MB. Max. memory is 14.3 GB. [2020-10-20 00:00:55,416 INFO L168 Benchmark]: Witness Printer took 349.89 ms. Allocated memory is still 300.9 MB. Free memory was 145.6 MB in the beginning and 90.4 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 14.3 GB. [2020-10-20 00:00:55,419 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.28 ms. Allocated memory is still 34.6 MB. Free memory was 13.0 MB in the beginning and 13.0 MB in the end (delta: 45.8 kB). Peak memory consumption was 45.8 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 524.18 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 16.5 MB in the beginning and 16.9 MB in the end (delta: -403.6 kB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 108.40 ms. Allocated memory was 44.0 MB in the beginning and 44.6 MB in the end (delta: 524.3 kB). Free memory was 16.9 MB in the beginning and 23.0 MB in the end (delta: -6.1 MB). Peak memory consumption was 3.6 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 57.26 ms. Allocated memory is still 44.6 MB. Free memory was 23.0 MB in the beginning and 19.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1145.55 ms. Allocated memory was 44.6 MB in the beginning and 47.2 MB in the end (delta: 2.6 MB). Free memory was 19.7 MB in the beginning and 13.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 11.6 MB. Max. memory is 14.3 GB. * TraceAbstraction took 39187.49 ms. Allocated memory was 47.2 MB in the beginning and 300.9 MB in the end (delta: 253.8 MB). Free memory was 13.1 MB in the beginning and 145.6 MB in the end (delta: -132.5 MB). Peak memory consumption was 259.0 MB. Max. memory is 14.3 GB. * Witness Printer took 349.89 ms. Allocated memory is still 300.9 MB. Free memory was 145.6 MB in the beginning and 90.4 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L288] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L4] __assert_fail("0", "psyco_abp_1-1.c", 4, "reach_error") VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 38.7s, OverallIterations: 40, TraceHistogramMax: 35, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8314 SDtfs, 12703 SDslu, 44187 SDs, 0 SdLazy, 6960 SolverSat, 733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4454 GetRequests, 4039 SyntacticMatches, 28 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 385 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 8561 NumberOfCodeBlocks, 8239 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 8097 ConstructedInterpolants, 0 QuantifiedInterpolants, 5984920 SizeOfPredicates, 61 NumberOfNonLiveVariables, 22562 ConjunctsInSsa, 623 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 9026/31839 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...