./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2969d4725852fd68e7759cdb7f1d1929ca0124c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:51:09,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:51:09,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:51:09,942 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:51:09,942 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:51:09,943 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:51:09,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:51:09,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:51:09,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:51:09,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:51:09,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:51:09,951 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:51:09,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:51:09,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:51:09,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:51:09,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:51:09,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:51:09,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:51:09,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:51:09,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:51:09,972 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:51:09,976 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:51:09,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:51:09,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:51:09,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:51:09,980 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:51:09,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:51:09,982 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:51:09,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:51:09,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:51:09,984 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:51:09,985 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:51:09,985 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:51:09,985 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:51:09,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:51:09,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:51:09,987 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:51:10,003 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:51:10,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:51:10,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:51:10,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:51:10,005 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:51:10,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:51:10,005 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:51:10,005 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:51:10,006 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:51:10,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:51:10,006 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:51:10,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:51:10,006 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:51:10,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:51:10,008 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:51:10,008 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:51:10,008 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:51:10,008 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:51:10,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:51:10,009 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:51:10,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:51:10,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:51:10,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:51:10,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:51:10,010 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:51:10,011 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:51:10,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:51:10,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:51:10,011 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2969d4725852fd68e7759cdb7f1d1929ca0124c [2018-12-31 10:51:10,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:51:10,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:51:10,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:51:10,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:51:10,088 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:51:10,089 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-12-31 10:51:10,159 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978634dba/e2db121853bf46fa90f7b1283ca58d2d/FLAGaf9091c49 [2018-12-31 10:51:10,696 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:51:10,697 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-12-31 10:51:10,708 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978634dba/e2db121853bf46fa90f7b1283ca58d2d/FLAGaf9091c49 [2018-12-31 10:51:11,012 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978634dba/e2db121853bf46fa90f7b1283ca58d2d [2018-12-31 10:51:11,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:51:11,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:51:11,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:51:11,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:51:11,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:51:11,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b31a9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11, skipping insertion in model container [2018-12-31 10:51:11,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:51:11,081 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:51:11,343 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:51:11,355 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:51:11,413 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:51:11,434 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:51:11,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11 WrapperNode [2018-12-31 10:51:11,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:51:11,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:51:11,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:51:11,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:51:11,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:51:11,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:51:11,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:51:11,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:51:11,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (1/1) ... [2018-12-31 10:51:11,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:51:11,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:51:11,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:51:11,600 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:51:11,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (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 [2018-12-31 10:51:11,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:51:11,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:51:12,613 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:51:12,613 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-31 10:51:12,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:51:12 BoogieIcfgContainer [2018-12-31 10:51:12,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:51:12,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:51:12,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:51:12,618 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:51:12,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:51:11" (1/3) ... [2018-12-31 10:51:12,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95c8518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:51:12, skipping insertion in model container [2018-12-31 10:51:12,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:51:11" (2/3) ... [2018-12-31 10:51:12,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95c8518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:51:12, skipping insertion in model container [2018-12-31 10:51:12,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:51:12" (3/3) ... [2018-12-31 10:51:12,624 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3_false-unreach-call.2.ufo.BOUNDED-6.pals_true-termination.c [2018-12-31 10:51:12,635 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:51:12,642 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 10:51:12,659 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 10:51:12,692 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:51:12,693 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:51:12,693 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:51:12,693 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:51:12,694 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:51:12,694 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:51:12,694 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:51:12,694 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:51:12,694 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:51:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2018-12-31 10:51:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 10:51:12,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:12,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:12,723 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:12,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1524648029, now seen corresponding path program 1 times [2018-12-31 10:51:12,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:12,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:12,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:12,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:12,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 10:51:12,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 10:51:13,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 10:51:13,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 10:51:13,006 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2018-12-31 10:51:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:13,165 INFO L93 Difference]: Finished difference Result 129 states and 206 transitions. [2018-12-31 10:51:13,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 10:51:13,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-31 10:51:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:13,179 INFO L225 Difference]: With dead ends: 129 [2018-12-31 10:51:13,179 INFO L226 Difference]: Without dead ends: 70 [2018-12-31 10:51:13,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:51:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-31 10:51:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-31 10:51:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-31 10:51:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2018-12-31 10:51:13,224 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 23 [2018-12-31 10:51:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:13,225 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2018-12-31 10:51:13,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 10:51:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2018-12-31 10:51:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 10:51:13,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:13,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:13,228 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:13,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:13,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1049597017, now seen corresponding path program 1 times [2018-12-31 10:51:13,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:13,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:13,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:13,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:13,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:13,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:13,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:51:13,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:51:13,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:51:13,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:13,367 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 3 states. [2018-12-31 10:51:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:13,456 INFO L93 Difference]: Finished difference Result 156 states and 232 transitions. [2018-12-31 10:51:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:51:13,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 10:51:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:13,460 INFO L225 Difference]: With dead ends: 156 [2018-12-31 10:51:13,460 INFO L226 Difference]: Without dead ends: 107 [2018-12-31 10:51:13,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-31 10:51:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-12-31 10:51:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-31 10:51:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2018-12-31 10:51:13,478 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 39 [2018-12-31 10:51:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:13,479 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2018-12-31 10:51:13,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:51:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2018-12-31 10:51:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-31 10:51:13,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:13,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:13,482 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2018870194, now seen corresponding path program 1 times [2018-12-31 10:51:13,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:13,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:13,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:13,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:13,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:51:13,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:51:13,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:51:13,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:13,677 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand 3 states. [2018-12-31 10:51:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:13,780 INFO L93 Difference]: Finished difference Result 249 states and 377 transitions. [2018-12-31 10:51:13,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:51:13,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-31 10:51:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:13,785 INFO L225 Difference]: With dead ends: 249 [2018-12-31 10:51:13,788 INFO L226 Difference]: Without dead ends: 165 [2018-12-31 10:51:13,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-31 10:51:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-12-31 10:51:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-31 10:51:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2018-12-31 10:51:13,813 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 40 [2018-12-31 10:51:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:13,813 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2018-12-31 10:51:13,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:51:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2018-12-31 10:51:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-31 10:51:13,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:13,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:13,816 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:13,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1411558281, now seen corresponding path program 1 times [2018-12-31 10:51:13,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:13,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:13,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:13,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:13,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:14,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:14,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:51:14,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:51:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:51:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:51:14,011 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 5 states. [2018-12-31 10:51:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:14,353 INFO L93 Difference]: Finished difference Result 731 states and 1126 transitions. [2018-12-31 10:51:14,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:51:14,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-12-31 10:51:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:14,365 INFO L225 Difference]: With dead ends: 731 [2018-12-31 10:51:14,365 INFO L226 Difference]: Without dead ends: 589 [2018-12-31 10:51:14,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:51:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-12-31 10:51:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 303. [2018-12-31 10:51:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-31 10:51:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 454 transitions. [2018-12-31 10:51:14,446 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 454 transitions. Word has length 41 [2018-12-31 10:51:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:14,447 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 454 transitions. [2018-12-31 10:51:14,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:51:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 454 transitions. [2018-12-31 10:51:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-31 10:51:14,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:14,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:14,453 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:14,453 INFO L82 PathProgramCache]: Analyzing trace with hash 425310312, now seen corresponding path program 1 times [2018-12-31 10:51:14,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:14,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:14,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:14,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:14,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:14,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:14,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 10:51:14,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:51:14,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:51:14,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:51:14,797 INFO L87 Difference]: Start difference. First operand 303 states and 454 transitions. Second operand 7 states. [2018-12-31 10:51:15,553 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 10:51:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:15,758 INFO L93 Difference]: Finished difference Result 617 states and 919 transitions. [2018-12-31 10:51:15,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 10:51:15,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-12-31 10:51:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:15,767 INFO L225 Difference]: With dead ends: 617 [2018-12-31 10:51:15,768 INFO L226 Difference]: Without dead ends: 615 [2018-12-31 10:51:15,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-12-31 10:51:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-12-31 10:51:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 327. [2018-12-31 10:51:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-12-31 10:51:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 478 transitions. [2018-12-31 10:51:15,798 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 478 transitions. Word has length 42 [2018-12-31 10:51:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:15,799 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 478 transitions. [2018-12-31 10:51:15,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:51:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 478 transitions. [2018-12-31 10:51:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 10:51:15,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:15,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:15,801 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash 352296257, now seen corresponding path program 1 times [2018-12-31 10:51:15,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:15,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:15,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:15,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:15,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:15,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:15,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:51:15,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:51:15,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:51:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:15,896 INFO L87 Difference]: Start difference. First operand 327 states and 478 transitions. Second operand 3 states. [2018-12-31 10:51:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:15,971 INFO L93 Difference]: Finished difference Result 879 states and 1292 transitions. [2018-12-31 10:51:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:51:15,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-31 10:51:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:15,976 INFO L225 Difference]: With dead ends: 879 [2018-12-31 10:51:15,977 INFO L226 Difference]: Without dead ends: 573 [2018-12-31 10:51:15,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-12-31 10:51:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 571. [2018-12-31 10:51:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-12-31 10:51:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 826 transitions. [2018-12-31 10:51:16,020 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 826 transitions. Word has length 43 [2018-12-31 10:51:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:16,020 INFO L480 AbstractCegarLoop]: Abstraction has 571 states and 826 transitions. [2018-12-31 10:51:16,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:51:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 826 transitions. [2018-12-31 10:51:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 10:51:16,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:16,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:16,023 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:16,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2025008167, now seen corresponding path program 1 times [2018-12-31 10:51:16,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:16,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:16,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:16,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:16,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:16,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:16,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:51:16,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:51:16,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:51:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:16,108 INFO L87 Difference]: Start difference. First operand 571 states and 826 transitions. Second operand 3 states. [2018-12-31 10:51:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:16,244 INFO L93 Difference]: Finished difference Result 1113 states and 1623 transitions. [2018-12-31 10:51:16,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:51:16,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-31 10:51:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:16,252 INFO L225 Difference]: With dead ends: 1113 [2018-12-31 10:51:16,252 INFO L226 Difference]: Without dead ends: 807 [2018-12-31 10:51:16,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-12-31 10:51:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 805. [2018-12-31 10:51:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2018-12-31 10:51:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1156 transitions. [2018-12-31 10:51:16,313 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1156 transitions. Word has length 43 [2018-12-31 10:51:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:16,313 INFO L480 AbstractCegarLoop]: Abstraction has 805 states and 1156 transitions. [2018-12-31 10:51:16,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:51:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1156 transitions. [2018-12-31 10:51:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-31 10:51:16,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:16,316 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:16,316 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:16,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2142126557, now seen corresponding path program 1 times [2018-12-31 10:51:16,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:16,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:16,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:16,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 10:51:16,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:16,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:51:16,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:51:16,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:51:16,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:51:16,484 INFO L87 Difference]: Start difference. First operand 805 states and 1156 transitions. Second operand 5 states. [2018-12-31 10:51:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:16,861 INFO L93 Difference]: Finished difference Result 2823 states and 4027 transitions. [2018-12-31 10:51:16,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:51:16,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-31 10:51:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:16,875 INFO L225 Difference]: With dead ends: 2823 [2018-12-31 10:51:16,876 INFO L226 Difference]: Without dead ends: 2041 [2018-12-31 10:51:16,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:51:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2018-12-31 10:51:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2037. [2018-12-31 10:51:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2018-12-31 10:51:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2868 transitions. [2018-12-31 10:51:17,054 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2868 transitions. Word has length 62 [2018-12-31 10:51:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:17,054 INFO L480 AbstractCegarLoop]: Abstraction has 2037 states and 2868 transitions. [2018-12-31 10:51:17,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:51:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2868 transitions. [2018-12-31 10:51:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 10:51:17,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:17,111 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:17,111 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:17,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:17,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932519, now seen corresponding path program 1 times [2018-12-31 10:51:17,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:17,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:17,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:17,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:17,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:17,504 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-31 10:51:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:51:17,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:51:17,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:51:17,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:17,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:51:18,054 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-12-31 10:51:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:51:18,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:51:18,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2018-12-31 10:51:18,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:51:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:51:18,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:51:18,286 INFO L87 Difference]: Start difference. First operand 2037 states and 2868 transitions. Second operand 7 states. [2018-12-31 10:51:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:19,157 INFO L93 Difference]: Finished difference Result 5052 states and 7158 transitions. [2018-12-31 10:51:19,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:51:19,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-12-31 10:51:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:19,180 INFO L225 Difference]: With dead ends: 5052 [2018-12-31 10:51:19,180 INFO L226 Difference]: Without dead ends: 3586 [2018-12-31 10:51:19,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-31 10:51:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2018-12-31 10:51:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3365. [2018-12-31 10:51:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3365 states. [2018-12-31 10:51:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4708 transitions. [2018-12-31 10:51:19,442 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4708 transitions. Word has length 63 [2018-12-31 10:51:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:19,443 INFO L480 AbstractCegarLoop]: Abstraction has 3365 states and 4708 transitions. [2018-12-31 10:51:19,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:51:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4708 transitions. [2018-12-31 10:51:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 10:51:19,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:19,449 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:19,449 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:19,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1752116912, now seen corresponding path program 1 times [2018-12-31 10:51:19,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:19,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:19,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:19,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:20,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:51:20,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:51:20,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:20,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:51:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:21,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:51:21,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-31 10:51:21,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 10:51:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 10:51:21,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-31 10:51:21,034 INFO L87 Difference]: Start difference. First operand 3365 states and 4708 transitions. Second operand 11 states. [2018-12-31 10:51:21,575 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-31 10:51:21,783 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 10:51:22,368 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 10:51:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:24,946 INFO L93 Difference]: Finished difference Result 11106 states and 15593 transitions. [2018-12-31 10:51:24,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:51:24,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-12-31 10:51:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:24,993 INFO L225 Difference]: With dead ends: 11106 [2018-12-31 10:51:24,993 INFO L226 Difference]: Without dead ends: 8752 [2018-12-31 10:51:25,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-12-31 10:51:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2018-12-31 10:51:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 4615. [2018-12-31 10:51:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4615 states. [2018-12-31 10:51:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6480 transitions. [2018-12-31 10:51:25,411 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6480 transitions. Word has length 64 [2018-12-31 10:51:25,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:25,412 INFO L480 AbstractCegarLoop]: Abstraction has 4615 states and 6480 transitions. [2018-12-31 10:51:25,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 10:51:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6480 transitions. [2018-12-31 10:51:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 10:51:25,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:25,417 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:25,417 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1324770848, now seen corresponding path program 1 times [2018-12-31 10:51:25,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:25,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:25,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:25,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:25,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:25,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:25,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:51:25,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:51:25,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:51:25,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:25,518 INFO L87 Difference]: Start difference. First operand 4615 states and 6480 transitions. Second operand 3 states. [2018-12-31 10:51:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:25,961 INFO L93 Difference]: Finished difference Result 7507 states and 10507 transitions. [2018-12-31 10:51:25,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:51:25,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-31 10:51:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:25,985 INFO L225 Difference]: With dead ends: 7507 [2018-12-31 10:51:25,986 INFO L226 Difference]: Without dead ends: 4880 [2018-12-31 10:51:25,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:25,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2018-12-31 10:51:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4683. [2018-12-31 10:51:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4683 states. [2018-12-31 10:51:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 6431 transitions. [2018-12-31 10:51:26,346 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 6431 transitions. Word has length 64 [2018-12-31 10:51:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:26,346 INFO L480 AbstractCegarLoop]: Abstraction has 4683 states and 6431 transitions. [2018-12-31 10:51:26,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:51:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 6431 transitions. [2018-12-31 10:51:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 10:51:26,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:26,350 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:26,351 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash -693070170, now seen corresponding path program 1 times [2018-12-31 10:51:26,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:26,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:26,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:26,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:26,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:26,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:51:26,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:51:26,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:51:26,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:26,498 INFO L87 Difference]: Start difference. First operand 4683 states and 6431 transitions. Second operand 3 states. [2018-12-31 10:51:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:26,831 INFO L93 Difference]: Finished difference Result 9747 states and 13357 transitions. [2018-12-31 10:51:26,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:51:26,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-12-31 10:51:26,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:26,858 INFO L225 Difference]: With dead ends: 9747 [2018-12-31 10:51:26,858 INFO L226 Difference]: Without dead ends: 6169 [2018-12-31 10:51:26,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2018-12-31 10:51:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 6129. [2018-12-31 10:51:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2018-12-31 10:51:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 8308 transitions. [2018-12-31 10:51:27,287 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 8308 transitions. Word has length 64 [2018-12-31 10:51:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:27,287 INFO L480 AbstractCegarLoop]: Abstraction has 6129 states and 8308 transitions. [2018-12-31 10:51:27,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:51:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 8308 transitions. [2018-12-31 10:51:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 10:51:27,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:27,292 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:27,293 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash 809095304, now seen corresponding path program 1 times [2018-12-31 10:51:27,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:27,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:27,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:27,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:27,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 10:51:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:27,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:51:27,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 10:51:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 10:51:27,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:51:27,549 INFO L87 Difference]: Start difference. First operand 6129 states and 8308 transitions. Second operand 6 states. [2018-12-31 10:51:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:28,740 INFO L93 Difference]: Finished difference Result 15825 states and 21360 transitions. [2018-12-31 10:51:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:51:28,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-31 10:51:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:28,763 INFO L225 Difference]: With dead ends: 15825 [2018-12-31 10:51:28,763 INFO L226 Difference]: Without dead ends: 9749 [2018-12-31 10:51:28,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:51:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2018-12-31 10:51:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 9535. [2018-12-31 10:51:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9535 states. [2018-12-31 10:51:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9535 states to 9535 states and 12798 transitions. [2018-12-31 10:51:29,275 INFO L78 Accepts]: Start accepts. Automaton has 9535 states and 12798 transitions. Word has length 64 [2018-12-31 10:51:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:29,275 INFO L480 AbstractCegarLoop]: Abstraction has 9535 states and 12798 transitions. [2018-12-31 10:51:29,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 10:51:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 9535 states and 12798 transitions. [2018-12-31 10:51:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 10:51:29,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:29,279 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:29,279 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash 107495430, now seen corresponding path program 1 times [2018-12-31 10:51:29,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:29,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:29,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:29,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:29,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:29,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:51:29,695 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:51:29,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:29,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:51:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:29,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:51:29,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-31 10:51:29,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 10:51:29,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 10:51:29,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-31 10:51:29,926 INFO L87 Difference]: Start difference. First operand 9535 states and 12798 transitions. Second operand 11 states. [2018-12-31 10:51:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:31,453 INFO L93 Difference]: Finished difference Result 22389 states and 30243 transitions. [2018-12-31 10:51:31,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:51:31,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-12-31 10:51:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:31,497 INFO L225 Difference]: With dead ends: 22389 [2018-12-31 10:51:31,497 INFO L226 Difference]: Without dead ends: 19815 [2018-12-31 10:51:31,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-12-31 10:51:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19815 states. [2018-12-31 10:51:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19815 to 10727. [2018-12-31 10:51:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10727 states. [2018-12-31 10:51:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10727 states to 10727 states and 14421 transitions. [2018-12-31 10:51:32,293 INFO L78 Accepts]: Start accepts. Automaton has 10727 states and 14421 transitions. Word has length 64 [2018-12-31 10:51:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:32,293 INFO L480 AbstractCegarLoop]: Abstraction has 10727 states and 14421 transitions. [2018-12-31 10:51:32,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 10:51:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 10727 states and 14421 transitions. [2018-12-31 10:51:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 10:51:32,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:32,298 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:32,298 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:32,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1571663051, now seen corresponding path program 1 times [2018-12-31 10:51:32,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:32,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:32,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:32,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:32,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:32,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:32,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:51:32,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:51:32,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:51:32,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:32,395 INFO L87 Difference]: Start difference. First operand 10727 states and 14421 transitions. Second operand 3 states. [2018-12-31 10:51:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:32,834 INFO L93 Difference]: Finished difference Result 13460 states and 17861 transitions. [2018-12-31 10:51:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:51:32,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-31 10:51:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:32,851 INFO L225 Difference]: With dead ends: 13460 [2018-12-31 10:51:32,851 INFO L226 Difference]: Without dead ends: 9173 [2018-12-31 10:51:32,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9173 states. [2018-12-31 10:51:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9173 to 9155. [2018-12-31 10:51:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9155 states. [2018-12-31 10:51:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9155 states to 9155 states and 11985 transitions. [2018-12-31 10:51:33,831 INFO L78 Accepts]: Start accepts. Automaton has 9155 states and 11985 transitions. Word has length 65 [2018-12-31 10:51:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:33,832 INFO L480 AbstractCegarLoop]: Abstraction has 9155 states and 11985 transitions. [2018-12-31 10:51:33,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:51:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 9155 states and 11985 transitions. [2018-12-31 10:51:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 10:51:33,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:33,837 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:33,837 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1664257503, now seen corresponding path program 1 times [2018-12-31 10:51:33,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:33,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:33,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:33,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:33,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:34,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:51:34,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:51:34,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:34,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:51:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:34,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:51:34,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-31 10:51:34,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 10:51:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 10:51:34,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-31 10:51:34,473 INFO L87 Difference]: Start difference. First operand 9155 states and 11985 transitions. Second operand 11 states. [2018-12-31 10:51:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:35,448 INFO L93 Difference]: Finished difference Result 18660 states and 24234 transitions. [2018-12-31 10:51:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:51:35,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-12-31 10:51:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:35,471 INFO L225 Difference]: With dead ends: 18660 [2018-12-31 10:51:35,471 INFO L226 Difference]: Without dead ends: 13612 [2018-12-31 10:51:35,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-12-31 10:51:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13612 states. [2018-12-31 10:51:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13612 to 9445. [2018-12-31 10:51:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2018-12-31 10:51:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 12263 transitions. [2018-12-31 10:51:36,351 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 12263 transitions. Word has length 65 [2018-12-31 10:51:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:36,351 INFO L480 AbstractCegarLoop]: Abstraction has 9445 states and 12263 transitions. [2018-12-31 10:51:36,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 10:51:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 12263 transitions. [2018-12-31 10:51:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 10:51:36,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:36,355 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:36,355 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1283872475, now seen corresponding path program 1 times [2018-12-31 10:51:36,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:36,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:36,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:36,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:36,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:36,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:36,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:51:36,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:51:36,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:51:36,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:36,448 INFO L87 Difference]: Start difference. First operand 9445 states and 12263 transitions. Second operand 3 states. [2018-12-31 10:51:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:37,101 INFO L93 Difference]: Finished difference Result 17877 states and 23264 transitions. [2018-12-31 10:51:37,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:51:37,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-31 10:51:37,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:37,119 INFO L225 Difference]: With dead ends: 17877 [2018-12-31 10:51:37,119 INFO L226 Difference]: Without dead ends: 11695 [2018-12-31 10:51:37,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:51:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2018-12-31 10:51:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 11469. [2018-12-31 10:51:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11469 states. [2018-12-31 10:51:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 14643 transitions. [2018-12-31 10:51:37,964 INFO L78 Accepts]: Start accepts. Automaton has 11469 states and 14643 transitions. Word has length 65 [2018-12-31 10:51:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:37,965 INFO L480 AbstractCegarLoop]: Abstraction has 11469 states and 14643 transitions. [2018-12-31 10:51:37,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:51:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 11469 states and 14643 transitions. [2018-12-31 10:51:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 10:51:37,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:37,970 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:37,970 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:37,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:37,971 INFO L82 PathProgramCache]: Analyzing trace with hash 815203644, now seen corresponding path program 1 times [2018-12-31 10:51:37,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:37,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:37,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:37,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:37,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 10:51:38,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:38,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:51:38,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:51:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:51:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:51:38,120 INFO L87 Difference]: Start difference. First operand 11469 states and 14643 transitions. Second operand 5 states. [2018-12-31 10:51:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:39,221 INFO L93 Difference]: Finished difference Result 17982 states and 23210 transitions. [2018-12-31 10:51:39,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:51:39,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-31 10:51:39,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:39,240 INFO L225 Difference]: With dead ends: 17982 [2018-12-31 10:51:39,240 INFO L226 Difference]: Without dead ends: 15048 [2018-12-31 10:51:39,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:51:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15048 states. [2018-12-31 10:51:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15048 to 12838. [2018-12-31 10:51:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12838 states. [2018-12-31 10:51:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12838 states to 12838 states and 16362 transitions. [2018-12-31 10:51:40,531 INFO L78 Accepts]: Start accepts. Automaton has 12838 states and 16362 transitions. Word has length 65 [2018-12-31 10:51:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:40,531 INFO L480 AbstractCegarLoop]: Abstraction has 12838 states and 16362 transitions. [2018-12-31 10:51:40,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:51:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12838 states and 16362 transitions. [2018-12-31 10:51:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 10:51:40,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:40,537 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:40,538 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:40,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash 352986821, now seen corresponding path program 1 times [2018-12-31 10:51:40,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:40,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:40,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:40,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:40,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 10:51:40,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:40,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:51:40,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:51:40,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:51:40,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:51:40,840 INFO L87 Difference]: Start difference. First operand 12838 states and 16362 transitions. Second operand 5 states. [2018-12-31 10:51:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:42,678 INFO L93 Difference]: Finished difference Result 19312 states and 24919 transitions. [2018-12-31 10:51:42,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:51:42,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 10:51:42,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:42,695 INFO L225 Difference]: With dead ends: 19312 [2018-12-31 10:51:42,695 INFO L226 Difference]: Without dead ends: 16403 [2018-12-31 10:51:42,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:51:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2018-12-31 10:51:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 15212. [2018-12-31 10:51:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15212 states. [2018-12-31 10:51:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15212 states to 15212 states and 19402 transitions. [2018-12-31 10:51:43,622 INFO L78 Accepts]: Start accepts. Automaton has 15212 states and 19402 transitions. Word has length 66 [2018-12-31 10:51:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:43,622 INFO L480 AbstractCegarLoop]: Abstraction has 15212 states and 19402 transitions. [2018-12-31 10:51:43,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:51:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 15212 states and 19402 transitions. [2018-12-31 10:51:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 10:51:43,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:43,627 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:43,627 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:43,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1404868071, now seen corresponding path program 1 times [2018-12-31 10:51:43,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:43,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:43,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:43,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:43,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:51:43,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:51:43,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:51:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:51:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:51:43,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:51:43,910 INFO L87 Difference]: Start difference. First operand 15212 states and 19402 transitions. Second operand 5 states. [2018-12-31 10:51:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:51:45,656 INFO L93 Difference]: Finished difference Result 21150 states and 27244 transitions. [2018-12-31 10:51:45,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:51:45,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-31 10:51:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:51:45,672 INFO L225 Difference]: With dead ends: 21150 [2018-12-31 10:51:45,673 INFO L226 Difference]: Without dead ends: 18424 [2018-12-31 10:51:45,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:51:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18424 states. [2018-12-31 10:51:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18424 to 17222. [2018-12-31 10:51:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17222 states. [2018-12-31 10:51:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17222 states to 17222 states and 21948 transitions. [2018-12-31 10:51:46,795 INFO L78 Accepts]: Start accepts. Automaton has 17222 states and 21948 transitions. Word has length 66 [2018-12-31 10:51:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:51:46,796 INFO L480 AbstractCegarLoop]: Abstraction has 17222 states and 21948 transitions. [2018-12-31 10:51:46,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:51:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 17222 states and 21948 transitions. [2018-12-31 10:51:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 10:51:46,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:51:46,802 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:51:46,802 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:51:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:51:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1470846148, now seen corresponding path program 1 times [2018-12-31 10:51:46,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:51:46,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:51:46,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:46,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:46,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:51:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:47,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:51:47,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:51:47,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:51:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:51:47,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:51:47,574 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-12-31 10:51:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:51:48,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:51:48,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-12-31 10:51:48,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-31 10:51:48,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-31 10:51:48,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-12-31 10:51:48,358 INFO L87 Difference]: Start difference. First operand 17222 states and 21948 transitions. Second operand 23 states. [2018-12-31 10:51:48,606 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-12-31 10:51:49,145 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2018-12-31 10:51:49,377 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2018-12-31 10:51:49,685 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2018-12-31 10:51:49,981 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-12-31 10:51:50,149 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2018-12-31 10:51:50,287 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-12-31 10:51:50,505 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2018-12-31 10:51:50,750 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2018-12-31 10:51:50,968 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-12-31 10:51:51,247 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-12-31 10:51:51,603 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2018-12-31 10:51:51,942 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2018-12-31 10:51:52,074 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-31 10:51:52,460 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-12-31 10:51:52,669 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-12-31 10:51:52,815 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-12-31 10:51:53,008 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-12-31 10:51:53,193 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2018-12-31 10:51:53,458 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2018-12-31 10:51:53,921 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-12-31 10:51:54,077 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-12-31 10:51:54,248 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-12-31 10:51:55,064 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-31 10:51:55,298 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2018-12-31 10:51:55,504 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-12-31 10:51:55,642 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-12-31 10:51:55,931 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2018-12-31 10:51:56,227 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2018-12-31 10:51:56,599 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-12-31 10:51:56,879 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-12-31 10:51:57,183 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-12-31 10:51:57,565 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2018-12-31 10:51:57,779 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-12-31 10:51:57,939 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-12-31 10:51:58,195 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-12-31 10:51:58,561 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-12-31 10:51:58,757 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-31 10:51:59,111 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2018-12-31 10:51:59,376 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-12-31 10:51:59,624 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-12-31 10:51:59,843 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-12-31 10:52:00,015 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2018-12-31 10:52:00,161 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-12-31 10:52:00,904 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2018-12-31 10:52:01,054 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-12-31 10:52:01,305 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-12-31 10:52:01,531 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-12-31 10:52:01,690 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-12-31 10:52:01,889 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-31 10:52:02,424 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2018-12-31 10:52:02,699 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2018-12-31 10:52:03,117 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-12-31 10:52:03,428 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-12-31 10:52:03,645 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-12-31 10:52:03,813 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-31 10:52:04,019 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2018-12-31 10:52:04,178 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-12-31 10:52:04,786 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2018-12-31 10:52:05,052 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-12-31 10:52:05,281 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-31 10:52:05,428 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-12-31 10:52:05,711 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-12-31 10:52:05,921 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-12-31 10:52:06,733 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2018-12-31 10:52:06,926 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-31 10:52:07,152 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-12-31 10:52:07,525 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-12-31 10:52:07,957 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2018-12-31 10:52:08,174 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-12-31 10:52:08,359 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2018-12-31 10:52:08,530 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2018-12-31 10:52:09,064 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-12-31 10:52:09,317 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-12-31 10:52:09,512 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-12-31 10:52:09,701 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-12-31 10:52:09,911 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2018-12-31 10:52:10,265 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-12-31 10:52:10,615 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2018-12-31 10:52:10,961 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-12-31 10:52:11,154 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-12-31 10:52:11,989 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-12-31 10:52:12,194 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2018-12-31 10:52:12,806 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-12-31 10:52:13,095 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2018-12-31 10:52:13,352 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2018-12-31 10:52:13,765 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-12-31 10:52:13,984 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-12-31 10:52:14,147 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2018-12-31 10:52:14,355 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-12-31 10:52:14,778 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2018-12-31 10:52:15,231 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 82 [2018-12-31 10:52:15,829 WARN L181 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-12-31 10:52:16,125 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-12-31 10:52:16,880 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2018-12-31 10:52:17,150 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-12-31 10:52:17,431 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2018-12-31 10:52:17,723 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-12-31 10:52:17,932 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-31 10:52:18,274 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2018-12-31 10:52:18,537 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2018-12-31 10:52:18,855 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2018-12-31 10:52:19,258 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-12-31 10:52:20,335 WARN L181 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-12-31 10:52:20,732 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-12-31 10:52:21,121 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-12-31 10:52:22,141 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 83 [2018-12-31 10:52:22,578 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2018-12-31 10:52:22,982 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 86 [2018-12-31 10:52:23,214 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-12-31 10:52:23,440 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-12-31 10:52:23,670 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-12-31 10:52:23,867 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-12-31 10:52:24,410 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-12-31 10:52:24,754 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2018-12-31 10:52:25,060 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2018-12-31 10:52:25,331 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2018-12-31 10:52:25,567 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2018-12-31 10:52:25,797 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-12-31 10:52:25,957 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2018-12-31 10:52:26,081 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2018-12-31 10:52:26,251 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-12-31 10:52:26,741 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2018-12-31 10:52:27,256 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2018-12-31 10:52:27,580 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2018-12-31 10:52:27,909 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-12-31 10:52:28,152 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2018-12-31 10:52:28,481 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2018-12-31 10:52:28,719 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-12-31 10:52:28,882 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-12-31 10:52:29,191 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2018-12-31 10:52:29,515 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2018-12-31 10:52:29,661 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-12-31 10:52:29,854 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-12-31 10:52:29,992 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-12-31 10:52:30,218 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-12-31 10:52:30,588 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 92 [2018-12-31 10:52:30,865 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-12-31 10:52:31,045 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-31 10:52:31,225 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-12-31 10:52:31,599 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-12-31 10:52:31,935 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-12-31 10:52:32,227 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2018-12-31 10:52:32,471 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-12-31 10:52:32,761 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-12-31 10:52:33,030 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2018-12-31 10:52:33,179 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-12-31 10:52:33,360 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2018-12-31 10:52:33,620 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-12-31 10:52:33,802 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2018-12-31 10:52:33,947 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-12-31 10:52:34,146 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2018-12-31 10:52:34,315 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-31 10:52:34,571 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-12-31 10:52:34,993 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2018-12-31 10:52:35,214 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2018-12-31 10:52:35,370 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2018-12-31 10:52:35,562 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-12-31 10:52:35,693 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-12-31 10:52:36,013 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-31 10:52:36,205 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-12-31 10:52:36,409 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-12-31 10:52:36,733 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-12-31 10:52:37,161 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-12-31 10:52:37,481 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2018-12-31 10:52:37,769 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-12-31 10:52:38,131 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2018-12-31 10:52:38,328 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-12-31 10:52:38,478 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-12-31 10:52:38,979 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-12-31 10:52:39,142 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-12-31 10:52:39,526 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2018-12-31 10:52:39,772 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2018-12-31 10:52:39,999 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-12-31 10:52:40,277 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-12-31 10:52:40,412 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-12-31 10:52:40,728 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2018-12-31 10:52:40,888 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2018-12-31 10:52:41,211 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2018-12-31 10:52:41,390 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2018-12-31 10:52:41,592 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-12-31 10:52:41,847 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-12-31 10:52:41,985 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-12-31 10:52:42,124 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-12-31 10:52:42,471 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-12-31 10:52:42,696 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-12-31 10:52:43,159 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-12-31 10:52:43,391 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-12-31 10:52:43,556 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-12-31 10:52:43,929 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-12-31 10:52:44,182 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-12-31 10:52:44,341 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-12-31 10:52:45,058 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-12-31 10:52:45,295 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-12-31 10:52:45,462 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-12-31 10:52:45,734 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-12-31 10:52:46,217 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-31 10:52:46,812 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2018-12-31 10:52:47,075 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2018-12-31 10:52:47,279 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-12-31 10:52:47,613 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-12-31 10:52:47,836 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-12-31 10:52:48,015 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2018-12-31 10:52:48,441 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-12-31 10:52:48,747 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2018-12-31 10:52:49,477 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-12-31 10:52:49,675 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-12-31 10:52:49,887 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2018-12-31 10:52:50,208 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-12-31 10:52:50,905 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2018-12-31 10:52:51,050 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-12-31 10:52:51,220 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-12-31 10:52:51,416 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-12-31 10:52:52,133 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2018-12-31 10:52:52,494 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2018-12-31 10:52:52,786 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-12-31 10:52:52,944 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-12-31 10:52:53,184 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2018-12-31 10:52:53,347 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2018-12-31 10:52:53,541 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2018-12-31 10:52:53,732 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-12-31 10:52:53,920 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-12-31 10:52:54,364 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-12-31 10:52:54,820 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-12-31 10:52:54,986 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-12-31 10:52:55,190 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-31 10:52:56,260 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-12-31 10:52:56,459 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-31 10:52:56,613 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2018-12-31 10:52:57,087 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-12-31 10:52:57,747 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-12-31 10:52:58,290 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-12-31 10:52:58,647 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-12-31 10:52:58,846 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-12-31 10:52:59,235 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-31 10:52:59,528 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2018-12-31 10:52:59,878 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-12-31 10:53:00,022 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-12-31 10:53:00,557 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-12-31 10:53:00,738 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-12-31 10:53:01,118 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-12-31 10:53:01,524 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-31 10:53:01,870 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-31 10:53:02,287 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-12-31 10:53:02,598 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-12-31 10:53:02,982 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-12-31 10:53:03,559 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-12-31 10:53:03,868 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-12-31 10:53:04,184 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-31 10:53:04,388 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2018-12-31 10:53:04,876 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2018-12-31 10:53:05,396 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2018-12-31 10:53:05,548 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2018-12-31 10:53:06,795 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2018-12-31 10:53:07,114 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2018-12-31 10:53:09,511 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-12-31 10:53:09,766 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2018-12-31 10:53:10,183 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-12-31 10:53:10,408 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2018-12-31 10:53:10,672 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-12-31 10:53:11,092 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-12-31 10:53:11,220 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2018-12-31 10:53:11,545 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-12-31 10:53:12,031 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-12-31 10:53:12,655 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-12-31 10:53:12,851 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2018-12-31 10:53:13,303 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-12-31 10:53:13,647 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-12-31 10:53:13,826 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-12-31 10:53:14,438 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-12-31 10:53:14,591 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-31 10:53:15,080 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-12-31 10:53:15,272 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-12-31 10:53:15,972 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-12-31 10:53:16,455 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2018-12-31 10:53:16,617 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-12-31 10:53:17,132 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-12-31 10:53:17,295 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-12-31 10:53:17,522 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-12-31 10:53:18,134 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-12-31 10:53:18,893 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-12-31 10:53:19,038 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-12-31 10:53:19,221 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-12-31 10:53:19,403 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2018-12-31 10:53:20,327 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-12-31 10:53:20,647 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2018-12-31 10:53:20,804 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2018-12-31 10:53:21,178 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-12-31 10:53:21,510 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-12-31 10:53:21,685 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2018-12-31 10:53:22,168 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-12-31 10:53:22,514 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-31 10:53:22,674 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-12-31 10:53:22,951 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-12-31 10:53:23,350 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-12-31 10:53:23,887 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-31 10:53:24,166 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-12-31 10:53:25,014 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-12-31 10:53:25,170 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-12-31 10:53:25,441 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-12-31 10:53:25,891 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-12-31 10:53:26,273 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2018-12-31 10:53:26,638 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-31 10:53:27,217 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2018-12-31 10:53:27,371 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-12-31 10:53:28,020 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2018-12-31 10:53:28,167 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-31 10:53:29,124 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-12-31 10:53:29,367 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2018-12-31 10:53:29,530 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-12-31 10:53:30,257 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-12-31 10:53:30,520 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2018-12-31 10:53:30,777 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-12-31 10:53:31,726 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2018-12-31 10:53:31,972 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-12-31 10:53:32,778 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2018-12-31 10:53:33,015 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2018-12-31 10:53:33,851 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2018-12-31 10:53:34,319 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-12-31 10:53:34,884 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-12-31 10:53:35,434 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-12-31 10:53:35,665 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-12-31 10:53:36,498 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-12-31 10:53:39,044 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2018-12-31 10:53:39,634 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2018-12-31 10:53:40,382 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2018-12-31 10:53:41,090 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91 [2018-12-31 10:53:42,217 WARN L181 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2018-12-31 10:53:42,470 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2018-12-31 10:53:43,227 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2018-12-31 10:53:43,472 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2018-12-31 10:53:44,215 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2018-12-31 10:53:44,508 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-12-31 10:53:44,711 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-12-31 10:53:44,985 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2018-12-31 10:53:45,759 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2018-12-31 10:53:46,058 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-12-31 10:53:46,261 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-12-31 10:53:46,535 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-12-31 10:53:47,271 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-12-31 10:53:47,497 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-12-31 10:53:48,170 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-12-31 10:53:48,393 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-12-31 10:53:49,817 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-12-31 10:53:50,018 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2018-12-31 10:53:50,742 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2018-12-31 10:53:50,976 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-12-31 10:54:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:54:06,540 INFO L93 Difference]: Finished difference Result 299094 states and 374745 transitions. [2018-12-31 10:54:06,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 575 states. [2018-12-31 10:54:06,540 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-12-31 10:54:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:54:06,874 INFO L225 Difference]: With dead ends: 299094 [2018-12-31 10:54:06,874 INFO L226 Difference]: Without dead ends: 288082 [2018-12-31 10:54:06,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 592 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175220 ImplicationChecksByTransitivity, 98.0s TimeCoverageRelationStatistics Valid=36014, Invalid=316228, Unknown=0, NotChecked=0, Total=352242 [2018-12-31 10:54:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288082 states. [2018-12-31 10:54:15,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288082 to 51072. [2018-12-31 10:54:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51072 states. [2018-12-31 10:54:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51072 states to 51072 states and 66079 transitions. [2018-12-31 10:54:15,131 INFO L78 Accepts]: Start accepts. Automaton has 51072 states and 66079 transitions. Word has length 70 [2018-12-31 10:54:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:54:15,131 INFO L480 AbstractCegarLoop]: Abstraction has 51072 states and 66079 transitions. [2018-12-31 10:54:15,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-31 10:54:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 51072 states and 66079 transitions. [2018-12-31 10:54:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 10:54:15,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:54:15,137 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:54:15,138 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:54:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:54:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1898192212, now seen corresponding path program 1 times [2018-12-31 10:54:15,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:54:15,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:54:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:54:15,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:54:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:54:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:54:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:54:15,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:54:15,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:54:15,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:54:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:54:15,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:54:16,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:54:16,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:54:16,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-12-31 10:54:16,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-31 10:54:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-31 10:54:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-31 10:54:16,033 INFO L87 Difference]: Start difference. First operand 51072 states and 66079 transitions. Second operand 15 states. [2018-12-31 10:54:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:54:39,364 INFO L93 Difference]: Finished difference Result 173844 states and 221212 transitions. [2018-12-31 10:54:39,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-31 10:54:39,366 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-12-31 10:54:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:54:39,503 INFO L225 Difference]: With dead ends: 173844 [2018-12-31 10:54:39,503 INFO L226 Difference]: Without dead ends: 127239 [2018-12-31 10:54:39,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=525, Invalid=1545, Unknown=0, NotChecked=0, Total=2070 [2018-12-31 10:54:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127239 states. [2018-12-31 10:54:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127239 to 62770. [2018-12-31 10:54:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62770 states. [2018-12-31 10:54:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62770 states to 62770 states and 80450 transitions. [2018-12-31 10:54:52,414 INFO L78 Accepts]: Start accepts. Automaton has 62770 states and 80450 transitions. Word has length 70 [2018-12-31 10:54:52,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:54:52,415 INFO L480 AbstractCegarLoop]: Abstraction has 62770 states and 80450 transitions. [2018-12-31 10:54:52,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-31 10:54:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 62770 states and 80450 transitions. [2018-12-31 10:54:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 10:54:52,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:54:52,421 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:54:52,421 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:54:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:54:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash -468502382, now seen corresponding path program 1 times [2018-12-31 10:54:52,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:54:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:54:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:54:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:54:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:54:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:54:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 10:54:52,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:54:52,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:54:52,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 10:54:52,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 10:54:52,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:54:52,813 INFO L87 Difference]: Start difference. First operand 62770 states and 80450 transitions. Second operand 6 states. [2018-12-31 10:54:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:54:59,665 INFO L93 Difference]: Finished difference Result 100615 states and 128664 transitions. [2018-12-31 10:54:59,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:54:59,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-31 10:54:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:54:59,712 INFO L225 Difference]: With dead ends: 100615 [2018-12-31 10:54:59,712 INFO L226 Difference]: Without dead ends: 42296 [2018-12-31 10:54:59,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:54:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42296 states. [2018-12-31 10:55:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42296 to 38738. [2018-12-31 10:55:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2018-12-31 10:55:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 48497 transitions. [2018-12-31 10:55:05,354 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 48497 transitions. Word has length 70 [2018-12-31 10:55:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:55:05,354 INFO L480 AbstractCegarLoop]: Abstraction has 38738 states and 48497 transitions. [2018-12-31 10:55:05,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 10:55:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 48497 transitions. [2018-12-31 10:55:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-31 10:55:05,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:55:05,359 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:55:05,360 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:55:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:55:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash 617046017, now seen corresponding path program 1 times [2018-12-31 10:55:05,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:55:05,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:55:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:55:05,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:55:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:55:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:55:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:55:05,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:55:05,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:55:05,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:55:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:55:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:55:05,441 INFO L87 Difference]: Start difference. First operand 38738 states and 48497 transitions. Second operand 3 states. [2018-12-31 10:55:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:55:11,053 INFO L93 Difference]: Finished difference Result 47868 states and 59761 transitions. [2018-12-31 10:55:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:55:11,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-31 10:55:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:55:11,094 INFO L225 Difference]: With dead ends: 47868 [2018-12-31 10:55:11,094 INFO L226 Difference]: Without dead ends: 37675 [2018-12-31 10:55:11,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:55:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37675 states. [2018-12-31 10:55:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37675 to 37673. [2018-12-31 10:55:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37673 states. [2018-12-31 10:55:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37673 states to 37673 states and 46579 transitions. [2018-12-31 10:55:16,703 INFO L78 Accepts]: Start accepts. Automaton has 37673 states and 46579 transitions. Word has length 71 [2018-12-31 10:55:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:55:16,703 INFO L480 AbstractCegarLoop]: Abstraction has 37673 states and 46579 transitions. [2018-12-31 10:55:16,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:55:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37673 states and 46579 transitions. [2018-12-31 10:55:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:55:16,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:55:16,708 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:55:16,708 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:55:16,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:55:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1402634332, now seen corresponding path program 1 times [2018-12-31 10:55:16,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:55:16,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:55:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:55:16,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:55:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:55:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:55:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:55:17,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:55:17,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:55:17,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:55:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:55:17,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:55:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:55:18,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:55:18,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 36 [2018-12-31 10:55:18,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-31 10:55:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-31 10:55:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2018-12-31 10:55:18,986 INFO L87 Difference]: Start difference. First operand 37673 states and 46579 transitions. Second operand 36 states. [2018-12-31 10:55:20,579 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-12-31 10:55:20,882 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-12-31 10:55:21,356 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-12-31 10:55:22,433 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2018-12-31 10:55:24,467 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-31 10:55:25,148 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2018-12-31 10:55:25,316 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2018-12-31 10:55:25,587 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-31 10:55:26,335 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-31 10:55:26,530 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-31 10:55:27,336 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-12-31 10:55:27,505 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-12-31 10:55:27,896 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-12-31 10:55:28,325 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2018-12-31 10:55:28,707 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2018-12-31 10:55:28,915 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-31 10:55:29,064 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-31 10:55:29,581 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2018-12-31 10:55:29,820 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-31 10:55:30,231 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-12-31 10:55:30,458 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-12-31 10:55:30,978 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2018-12-31 10:55:31,198 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-12-31 10:55:31,393 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2018-12-31 10:55:31,914 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2018-12-31 10:55:32,138 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-12-31 10:55:32,424 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2018-12-31 10:55:32,782 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-12-31 10:55:33,213 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-31 10:55:33,480 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-12-31 10:55:33,647 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-12-31 10:55:33,900 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 39 [2018-12-31 10:55:34,132 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2018-12-31 10:55:34,424 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-12-31 10:55:34,676 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2018-12-31 10:55:34,903 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2018-12-31 10:55:35,136 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2018-12-31 10:55:35,483 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-31 10:55:35,742 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-12-31 10:55:35,957 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2018-12-31 10:55:36,272 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2018-12-31 10:55:36,496 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2018-12-31 10:55:36,750 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-31 10:55:37,016 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2018-12-31 10:55:37,634 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2018-12-31 10:55:37,815 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-12-31 10:55:37,999 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-12-31 10:55:38,252 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-12-31 10:55:38,535 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2018-12-31 10:55:38,731 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2018-12-31 10:55:39,079 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-12-31 10:55:39,307 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2018-12-31 10:55:39,716 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-12-31 10:55:40,511 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-12-31 10:55:41,080 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-12-31 10:55:43,047 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-12-31 10:55:43,354 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-12-31 10:55:44,467 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-12-31 10:55:45,014 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2018-12-31 10:55:48,060 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2018-12-31 10:55:48,214 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2018-12-31 10:55:48,556 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-12-31 10:55:48,721 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-12-31 10:55:48,929 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2018-12-31 10:55:49,811 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-12-31 10:55:50,101 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-12-31 10:55:50,549 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-12-31 10:55:50,859 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-31 10:55:51,353 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-12-31 10:55:51,525 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-12-31 10:55:51,712 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-12-31 10:55:51,860 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-12-31 10:55:52,279 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-12-31 10:55:52,517 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2018-12-31 10:55:52,673 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-12-31 10:56:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:56:01,555 INFO L93 Difference]: Finished difference Result 103211 states and 126813 transitions. [2018-12-31 10:56:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-12-31 10:56:01,555 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2018-12-31 10:56:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:56:01,631 INFO L225 Difference]: With dead ends: 103211 [2018-12-31 10:56:01,631 INFO L226 Difference]: Without dead ends: 79333 [2018-12-31 10:56:01,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14790 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=4870, Invalid=35732, Unknown=0, NotChecked=0, Total=40602 [2018-12-31 10:56:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79333 states. [2018-12-31 10:56:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79333 to 52617. [2018-12-31 10:56:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52617 states. [2018-12-31 10:56:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52617 states to 52617 states and 65098 transitions. [2018-12-31 10:56:10,034 INFO L78 Accepts]: Start accepts. Automaton has 52617 states and 65098 transitions. Word has length 72 [2018-12-31 10:56:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:56:10,035 INFO L480 AbstractCegarLoop]: Abstraction has 52617 states and 65098 transitions. [2018-12-31 10:56:10,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-31 10:56:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 52617 states and 65098 transitions. [2018-12-31 10:56:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 10:56:10,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:56:10,046 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:56:10,047 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:56:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:56:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash -310258425, now seen corresponding path program 1 times [2018-12-31 10:56:10,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:56:10,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:56:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:56:10,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:56:10,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:56:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:56:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 10:56:10,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:56:10,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:56:10,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:56:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:56:10,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:56:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 10:56:10,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:56:10,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-31 10:56:10,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 10:56:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 10:56:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 10:56:10,413 INFO L87 Difference]: Start difference. First operand 52617 states and 65098 transitions. Second operand 4 states. [2018-12-31 10:56:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:56:27,251 INFO L93 Difference]: Finished difference Result 152298 states and 188305 transitions. [2018-12-31 10:56:27,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:56:27,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 10:56:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:56:27,351 INFO L225 Difference]: With dead ends: 152298 [2018-12-31 10:56:27,351 INFO L226 Difference]: Without dead ends: 99737 [2018-12-31 10:56:27,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:56:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99737 states. [2018-12-31 10:56:40,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99737 to 76472. [2018-12-31 10:56:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76472 states. [2018-12-31 10:56:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76472 states to 76472 states and 94176 transitions. [2018-12-31 10:56:40,341 INFO L78 Accepts]: Start accepts. Automaton has 76472 states and 94176 transitions. Word has length 95 [2018-12-31 10:56:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:56:40,341 INFO L480 AbstractCegarLoop]: Abstraction has 76472 states and 94176 transitions. [2018-12-31 10:56:40,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 10:56:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 76472 states and 94176 transitions. [2018-12-31 10:56:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 10:56:40,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:56:40,356 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:56:40,356 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:56:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:56:40,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2139341705, now seen corresponding path program 1 times [2018-12-31 10:56:40,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:56:40,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:56:40,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:56:40,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:56:40,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:56:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:56:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-31 10:56:40,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:56:40,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:56:40,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 10:56:40,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 10:56:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:56:40,801 INFO L87 Difference]: Start difference. First operand 76472 states and 94176 transitions. Second operand 6 states. [2018-12-31 10:56:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:56:51,665 INFO L93 Difference]: Finished difference Result 91712 states and 112914 transitions. [2018-12-31 10:56:51,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:56:51,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-12-31 10:56:51,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:56:51,727 INFO L225 Difference]: With dead ends: 91712 [2018-12-31 10:56:51,727 INFO L226 Difference]: Without dead ends: 62612 [2018-12-31 10:56:51,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:56:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62612 states. [2018-12-31 10:57:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62612 to 60853. [2018-12-31 10:57:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60853 states. [2018-12-31 10:57:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60853 states to 60853 states and 74567 transitions. [2018-12-31 10:57:02,075 INFO L78 Accepts]: Start accepts. Automaton has 60853 states and 74567 transitions. Word has length 95 [2018-12-31 10:57:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:57:02,076 INFO L480 AbstractCegarLoop]: Abstraction has 60853 states and 74567 transitions. [2018-12-31 10:57:02,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 10:57:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 60853 states and 74567 transitions. [2018-12-31 10:57:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-31 10:57:02,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:57:02,091 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:57:02,091 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:57:02,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:57:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1243063571, now seen corresponding path program 2 times [2018-12-31 10:57:02,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:57:02,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:57:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:57:02,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:57:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:57:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:57:02,338 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2018-12-31 10:57:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-31 10:57:02,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:57:02,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:57:02,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:57:02,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:57:02,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:57:02,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:57:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 19 proven. 46 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-31 10:57:02,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:57:02,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 13 [2018-12-31 10:57:02,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 10:57:02,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 10:57:02,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-12-31 10:57:02,714 INFO L87 Difference]: Start difference. First operand 60853 states and 74567 transitions. Second operand 13 states. [2018-12-31 10:57:03,219 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-31 10:57:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:57:26,351 INFO L93 Difference]: Finished difference Result 158078 states and 193600 transitions. [2018-12-31 10:57:26,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-31 10:57:26,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2018-12-31 10:57:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:57:26,463 INFO L225 Difference]: With dead ends: 158078 [2018-12-31 10:57:26,463 INFO L226 Difference]: Without dead ends: 109961 [2018-12-31 10:57:26,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2202 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1224, Invalid=4628, Unknown=0, NotChecked=0, Total=5852 [2018-12-31 10:57:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109961 states. [2018-12-31 10:57:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109961 to 91633. [2018-12-31 10:57:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91633 states. [2018-12-31 10:57:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91633 states to 91633 states and 111359 transitions. [2018-12-31 10:57:44,984 INFO L78 Accepts]: Start accepts. Automaton has 91633 states and 111359 transitions. Word has length 104 [2018-12-31 10:57:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:57:44,984 INFO L480 AbstractCegarLoop]: Abstraction has 91633 states and 111359 transitions. [2018-12-31 10:57:44,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 10:57:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 91633 states and 111359 transitions. [2018-12-31 10:57:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-31 10:57:45,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:57:45,005 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:57:45,005 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:57:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:57:45,005 INFO L82 PathProgramCache]: Analyzing trace with hash -719825780, now seen corresponding path program 1 times [2018-12-31 10:57:45,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:57:45,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:57:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:57:45,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:57:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:57:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:57:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-31 10:57:45,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:57:45,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:57:45,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:57:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:57:45,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:57:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-31 10:57:45,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:57:45,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 16 [2018-12-31 10:57:45,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-31 10:57:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-31 10:57:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-12-31 10:57:45,633 INFO L87 Difference]: Start difference. First operand 91633 states and 111359 transitions. Second operand 16 states. [2018-12-31 10:57:46,007 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-12-31 10:57:46,225 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-12-31 10:57:46,615 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-31 10:57:46,736 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-12-31 10:57:46,877 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-12-31 10:57:47,011 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-12-31 10:57:47,176 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-12-31 10:57:47,430 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-12-31 10:57:47,560 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-31 10:57:47,846 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-12-31 10:57:47,972 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-31 10:57:48,610 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-31 10:57:48,784 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-12-31 10:57:48,958 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-12-31 10:57:49,128 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-31 10:57:49,263 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-12-31 10:57:49,490 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-31 10:57:49,626 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-31 10:57:49,806 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-31 10:57:49,974 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-12-31 10:57:50,126 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-12-31 10:57:50,783 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-12-31 10:57:51,021 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-12-31 10:57:51,382 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-12-31 10:57:51,878 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-12-31 10:57:52,051 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-12-31 10:57:52,191 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-31 10:57:52,993 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-12-31 10:57:53,256 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-31 10:57:53,558 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-12-31 10:57:53,699 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-31 10:57:53,835 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-31 10:57:53,997 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-12-31 10:57:54,140 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-12-31 10:57:54,415 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-31 10:57:54,546 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2018-12-31 10:57:54,693 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-12-31 10:57:54,849 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-12-31 10:57:55,126 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-12-31 10:57:55,774 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-12-31 10:57:55,937 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-31 10:57:56,104 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-31 10:57:56,498 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-12-31 10:57:57,393 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-31 10:57:58,141 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-12-31 10:57:58,835 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-31 10:57:59,181 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-31 10:58:00,227 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-12-31 10:58:00,847 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-31 10:58:01,057 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-31 10:58:01,356 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-12-31 10:58:01,626 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2018-12-31 10:58:01,853 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-31 10:58:01,994 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-12-31 10:58:02,635 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-12-31 10:58:07,775 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-12-31 10:58:08,046 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-12-31 10:58:08,690 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-31 10:58:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:58:10,860 INFO L93 Difference]: Finished difference Result 137030 states and 165800 transitions. [2018-12-31 10:58:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-12-31 10:58:10,860 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 116 [2018-12-31 10:58:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:58:10,910 INFO L225 Difference]: With dead ends: 137030 [2018-12-31 10:58:10,911 INFO L226 Difference]: Without dead ends: 45448 [2018-12-31 10:58:10,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7541 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=2994, Invalid=15912, Unknown=0, NotChecked=0, Total=18906 [2018-12-31 10:58:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45448 states. [2018-12-31 10:58:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45448 to 25514. [2018-12-31 10:58:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25514 states. [2018-12-31 10:58:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25514 states to 25514 states and 29876 transitions. [2018-12-31 10:58:16,684 INFO L78 Accepts]: Start accepts. Automaton has 25514 states and 29876 transitions. Word has length 116 [2018-12-31 10:58:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:58:16,685 INFO L480 AbstractCegarLoop]: Abstraction has 25514 states and 29876 transitions. [2018-12-31 10:58:16,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-31 10:58:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25514 states and 29876 transitions. [2018-12-31 10:58:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-31 10:58:16,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:58:16,691 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:58:16,691 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:58:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:58:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1989910784, now seen corresponding path program 1 times [2018-12-31 10:58:16,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:58:16,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:58:16,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:58:16,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:58:16,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:58:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:58:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:58:17,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:58:17,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:58:17,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:58:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:58:17,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:58:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 10:58:18,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:58:18,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2018-12-31 10:58:18,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 10:58:18,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 10:58:18,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-12-31 10:58:18,420 INFO L87 Difference]: Start difference. First operand 25514 states and 29876 transitions. Second operand 25 states. [2018-12-31 10:58:20,014 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-12-31 10:58:20,400 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2018-12-31 10:58:21,033 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2018-12-31 10:58:21,658 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2018-12-31 10:58:22,301 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2018-12-31 10:58:22,967 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-12-31 10:58:24,006 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-12-31 10:58:24,400 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2018-12-31 10:58:24,901 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2018-12-31 10:58:25,322 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2018-12-31 10:58:25,514 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-12-31 10:58:28,044 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2018-12-31 10:58:28,305 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2018-12-31 10:58:28,729 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2018-12-31 10:58:29,197 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-31 10:58:30,003 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-12-31 10:58:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:58:53,421 INFO L93 Difference]: Finished difference Result 77543 states and 90289 transitions. [2018-12-31 10:58:53,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-12-31 10:58:53,422 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 118 [2018-12-31 10:58:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:58:53,482 INFO L225 Difference]: With dead ends: 77543 [2018-12-31 10:58:53,482 INFO L226 Difference]: Without dead ends: 68512 [2018-12-31 10:58:53,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15595 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=4385, Invalid=37027, Unknown=0, NotChecked=0, Total=41412 [2018-12-31 10:58:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68512 states. [2018-12-31 10:59:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68512 to 38140. [2018-12-31 10:59:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38140 states. [2018-12-31 10:59:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38140 states to 38140 states and 44550 transitions. [2018-12-31 10:59:02,183 INFO L78 Accepts]: Start accepts. Automaton has 38140 states and 44550 transitions. Word has length 118 [2018-12-31 10:59:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:59:02,183 INFO L480 AbstractCegarLoop]: Abstraction has 38140 states and 44550 transitions. [2018-12-31 10:59:02,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 10:59:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 38140 states and 44550 transitions. [2018-12-31 10:59:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-31 10:59:02,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:59:02,190 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:59:02,190 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:59:02,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:59:02,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1463958266, now seen corresponding path program 1 times [2018-12-31 10:59:02,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:59:02,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:59:02,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:59:02,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:59:02,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:59:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:59:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-31 10:59:02,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:59:02,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:59:02,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:59:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:59:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:59:02,507 INFO L87 Difference]: Start difference. First operand 38140 states and 44550 transitions. Second operand 3 states. [2018-12-31 10:59:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:59:07,711 INFO L93 Difference]: Finished difference Result 56727 states and 66440 transitions. [2018-12-31 10:59:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:59:07,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-12-31 10:59:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:59:07,732 INFO L225 Difference]: With dead ends: 56727 [2018-12-31 10:59:07,732 INFO L226 Difference]: Without dead ends: 20424 [2018-12-31 10:59:07,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:59:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20424 states. [2018-12-31 10:59:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20424 to 20279. [2018-12-31 10:59:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20279 states. [2018-12-31 10:59:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20279 states to 20279 states and 23398 transitions. [2018-12-31 10:59:12,635 INFO L78 Accepts]: Start accepts. Automaton has 20279 states and 23398 transitions. Word has length 120 [2018-12-31 10:59:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:59:12,635 INFO L480 AbstractCegarLoop]: Abstraction has 20279 states and 23398 transitions. [2018-12-31 10:59:12,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:59:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 20279 states and 23398 transitions. [2018-12-31 10:59:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-31 10:59:12,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:59:12,640 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 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] [2018-12-31 10:59:12,641 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:59:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:59:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1336352401, now seen corresponding path program 1 times [2018-12-31 10:59:12,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:59:12,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:59:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:59:12,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:59:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:59:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:59:13,132 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 10:59:13,388 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 10:59:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:59:13,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:59:13,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:59:13,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:59:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:59:13,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:59:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-31 10:59:14,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:59:14,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 24 [2018-12-31 10:59:14,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 10:59:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 10:59:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-12-31 10:59:14,782 INFO L87 Difference]: Start difference. First operand 20279 states and 23398 transitions. Second operand 25 states. [2018-12-31 10:59:15,403 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2018-12-31 10:59:15,736 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2018-12-31 10:59:16,763 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 41 [2018-12-31 10:59:17,070 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2018-12-31 10:59:17,229 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2018-12-31 10:59:17,377 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 41 [2018-12-31 10:59:17,611 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2018-12-31 10:59:17,845 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2018-12-31 10:59:18,030 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2018-12-31 10:59:18,331 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2018-12-31 10:59:18,618 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2018-12-31 10:59:19,080 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2018-12-31 10:59:19,364 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-12-31 10:59:19,594 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-12-31 10:59:19,898 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2018-12-31 10:59:20,412 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2018-12-31 10:59:20,726 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2018-12-31 10:59:20,915 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2018-12-31 10:59:21,071 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-12-31 10:59:21,282 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2018-12-31 10:59:21,500 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-12-31 10:59:21,817 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2018-12-31 10:59:22,237 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2018-12-31 10:59:22,500 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2018-12-31 10:59:23,287 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-12-31 10:59:23,521 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2018-12-31 10:59:23,763 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-12-31 10:59:24,012 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2018-12-31 10:59:24,463 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2018-12-31 10:59:25,015 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2018-12-31 10:59:25,190 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 45 [2018-12-31 10:59:25,563 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2018-12-31 10:59:25,795 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-12-31 10:59:26,003 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-12-31 10:59:26,237 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-31 10:59:27,229 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-12-31 10:59:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:59:35,534 INFO L93 Difference]: Finished difference Result 42762 states and 49163 transitions. [2018-12-31 10:59:35,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-31 10:59:35,534 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 120 [2018-12-31 10:59:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:59:35,556 INFO L225 Difference]: With dead ends: 42762 [2018-12-31 10:59:35,556 INFO L226 Difference]: Without dead ends: 27408 [2018-12-31 10:59:35,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1150, Invalid=5491, Unknown=1, NotChecked=0, Total=6642 [2018-12-31 10:59:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2018-12-31 10:59:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20262. [2018-12-31 10:59:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20262 states. [2018-12-31 10:59:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20262 states to 20262 states and 23277 transitions. [2018-12-31 10:59:40,919 INFO L78 Accepts]: Start accepts. Automaton has 20262 states and 23277 transitions. Word has length 120 [2018-12-31 10:59:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:59:40,919 INFO L480 AbstractCegarLoop]: Abstraction has 20262 states and 23277 transitions. [2018-12-31 10:59:40,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 10:59:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 20262 states and 23277 transitions. [2018-12-31 10:59:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-31 10:59:40,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:59:40,924 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:59:40,924 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:59:40,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:59:40,925 INFO L82 PathProgramCache]: Analyzing trace with hash 471660008, now seen corresponding path program 1 times [2018-12-31 10:59:40,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:59:40,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:59:40,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:59:40,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:59:40,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:59:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:59:41,309 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 10:59:41,541 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 10:59:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 26 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:59:41,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:59:41,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:59:41,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:59:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:59:41,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:59:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 34 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:59:42,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:59:42,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-12-31 10:59:42,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-31 10:59:42,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-31 10:59:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-12-31 10:59:42,226 INFO L87 Difference]: Start difference. First operand 20262 states and 23277 transitions. Second operand 22 states. [2018-12-31 10:59:43,993 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-12-31 10:59:46,063 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-31 10:59:47,046 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2018-12-31 10:59:47,190 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-31 10:59:47,372 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-12-31 10:59:47,537 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-12-31 10:59:47,675 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-12-31 10:59:48,162 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-31 10:59:48,491 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2018-12-31 10:59:48,765 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-12-31 10:59:49,023 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-12-31 10:59:49,210 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-31 10:59:49,397 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-12-31 10:59:49,551 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2018-12-31 10:59:49,906 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-12-31 10:59:50,470 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-12-31 10:59:50,783 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-31 10:59:51,058 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2018-12-31 10:59:51,256 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-12-31 10:59:51,415 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-12-31 10:59:52,244 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2018-12-31 10:59:53,033 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2018-12-31 10:59:53,253 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2018-12-31 10:59:53,562 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-31 10:59:54,117 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2018-12-31 10:59:54,280 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-12-31 10:59:54,548 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-12-31 10:59:54,937 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2018-12-31 10:59:55,503 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2018-12-31 10:59:55,639 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-31 10:59:55,997 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-12-31 10:59:56,383 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-12-31 11:00:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 11:00:01,705 INFO L93 Difference]: Finished difference Result 37153 states and 42614 transitions. [2018-12-31 11:00:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-31 11:00:01,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2018-12-31 11:00:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 11:00:01,727 INFO L225 Difference]: With dead ends: 37153 [2018-12-31 11:00:01,727 INFO L226 Difference]: Without dead ends: 23910 [2018-12-31 11:00:01,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1682, Invalid=7824, Unknown=0, NotChecked=0, Total=9506 [2018-12-31 11:00:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23910 states. [2018-12-31 11:00:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23910 to 14129. [2018-12-31 11:00:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14129 states. [2018-12-31 11:00:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14129 states to 14129 states and 16143 transitions. [2018-12-31 11:00:05,956 INFO L78 Accepts]: Start accepts. Automaton has 14129 states and 16143 transitions. Word has length 121 [2018-12-31 11:00:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 11:00:05,956 INFO L480 AbstractCegarLoop]: Abstraction has 14129 states and 16143 transitions. [2018-12-31 11:00:05,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-31 11:00:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14129 states and 16143 transitions. [2018-12-31 11:00:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-31 11:00:05,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 11:00:05,960 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 11:00:05,960 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 11:00:05,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 11:00:05,961 INFO L82 PathProgramCache]: Analyzing trace with hash 79598664, now seen corresponding path program 1 times [2018-12-31 11:00:05,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 11:00:05,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 11:00:05,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:00:05,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:00:05,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:00:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:00:06,393 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 11:00:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:00:06,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 11:00:06,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 11:00:06,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:00:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:00:06,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 11:00:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 58 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 11:00:07,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 11:00:07,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2018-12-31 11:00:07,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-31 11:00:07,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-31 11:00:07,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-12-31 11:00:07,241 INFO L87 Difference]: Start difference. First operand 14129 states and 16143 transitions. Second operand 22 states. [2018-12-31 11:00:09,536 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-12-31 11:00:10,758 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2018-12-31 11:00:12,159 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2018-12-31 11:00:12,465 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2018-12-31 11:00:13,170 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2018-12-31 11:00:13,405 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-12-31 11:00:13,689 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-12-31 11:00:14,019 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2018-12-31 11:00:14,412 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2018-12-31 11:00:14,895 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-12-31 11:00:15,260 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-12-31 11:00:15,625 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-12-31 11:00:15,965 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2018-12-31 11:00:17,148 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2018-12-31 11:00:17,522 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2018-12-31 11:00:18,029 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2018-12-31 11:00:18,220 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2018-12-31 11:00:18,430 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2018-12-31 11:00:18,675 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2018-12-31 11:00:18,863 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-12-31 11:00:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 11:00:24,336 INFO L93 Difference]: Finished difference Result 28030 states and 32099 transitions. [2018-12-31 11:00:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-31 11:00:24,337 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2018-12-31 11:00:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 11:00:24,354 INFO L225 Difference]: With dead ends: 28030 [2018-12-31 11:00:24,354 INFO L226 Difference]: Without dead ends: 19118 [2018-12-31 11:00:24,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1276, Invalid=5530, Unknown=0, NotChecked=0, Total=6806 [2018-12-31 11:00:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19118 states. [2018-12-31 11:00:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19118 to 11977. [2018-12-31 11:00:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11977 states. [2018-12-31 11:00:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11977 states to 11977 states and 13570 transitions. [2018-12-31 11:00:28,579 INFO L78 Accepts]: Start accepts. Automaton has 11977 states and 13570 transitions. Word has length 121 [2018-12-31 11:00:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 11:00:28,580 INFO L480 AbstractCegarLoop]: Abstraction has 11977 states and 13570 transitions. [2018-12-31 11:00:28,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-31 11:00:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 11977 states and 13570 transitions. [2018-12-31 11:00:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-31 11:00:28,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 11:00:28,585 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 11:00:28,585 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 11:00:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 11:00:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash -597801272, now seen corresponding path program 1 times [2018-12-31 11:00:28,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 11:00:28,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 11:00:28,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:00:28,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:00:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:00:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:00:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 37 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:00:29,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 11:00:29,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 11:00:29,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:00:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:00:29,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 11:00:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 37 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:00:31,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 11:00:31,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-12-31 11:00:31,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-31 11:00:31,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-31 11:00:31,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2018-12-31 11:00:31,108 INFO L87 Difference]: Start difference. First operand 11977 states and 13570 transitions. Second operand 32 states. [2018-12-31 11:00:31,424 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-31 11:00:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 11:00:41,984 INFO L93 Difference]: Finished difference Result 20841 states and 23584 transitions. [2018-12-31 11:00:41,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-31 11:00:41,984 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 123 [2018-12-31 11:00:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 11:00:42,001 INFO L225 Difference]: With dead ends: 20841 [2018-12-31 11:00:42,001 INFO L226 Difference]: Without dead ends: 17389 [2018-12-31 11:00:42,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=385, Invalid=2371, Unknown=0, NotChecked=0, Total=2756 [2018-12-31 11:00:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17389 states. [2018-12-31 11:00:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17389 to 13481. [2018-12-31 11:00:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13481 states. [2018-12-31 11:00:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13481 states to 13481 states and 15262 transitions. [2018-12-31 11:00:46,784 INFO L78 Accepts]: Start accepts. Automaton has 13481 states and 15262 transitions. Word has length 123 [2018-12-31 11:00:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 11:00:46,785 INFO L480 AbstractCegarLoop]: Abstraction has 13481 states and 15262 transitions. [2018-12-31 11:00:46,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-31 11:00:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 13481 states and 15262 transitions. [2018-12-31 11:00:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-31 11:00:46,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 11:00:46,788 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 11:00:46,789 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 11:00:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 11:00:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2096456030, now seen corresponding path program 1 times [2018-12-31 11:00:46,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 11:00:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 11:00:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:00:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:00:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:00:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:00:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 30 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:00:47,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 11:00:47,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 11:00:47,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:00:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:00:47,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 11:00:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 34 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:00:48,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 11:00:48,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-12-31 11:00:48,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 11:00:48,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 11:00:48,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-31 11:00:48,250 INFO L87 Difference]: Start difference. First operand 13481 states and 15262 transitions. Second operand 21 states. [2018-12-31 11:00:51,478 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2018-12-31 11:00:52,561 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-12-31 11:00:53,077 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-31 11:00:53,958 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-12-31 11:00:54,517 WARN L181 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2018-12-31 11:01:07,741 WARN L181 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2018-12-31 11:01:14,163 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2018-12-31 11:01:16,633 WARN L181 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2018-12-31 11:01:17,848 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-31 11:01:18,148 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-31 11:01:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 11:01:28,155 INFO L93 Difference]: Finished difference Result 33906 states and 38075 transitions. [2018-12-31 11:01:28,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-31 11:01:28,155 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 123 [2018-12-31 11:01:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 11:01:28,179 INFO L225 Difference]: With dead ends: 33906 [2018-12-31 11:01:28,179 INFO L226 Difference]: Without dead ends: 28802 [2018-12-31 11:01:28,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=503, Invalid=2355, Unknown=4, NotChecked=0, Total=2862 [2018-12-31 11:01:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28802 states. [2018-12-31 11:01:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28802 to 17652. [2018-12-31 11:01:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17652 states. [2018-12-31 11:01:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17652 states to 17652 states and 19892 transitions. [2018-12-31 11:01:34,838 INFO L78 Accepts]: Start accepts. Automaton has 17652 states and 19892 transitions. Word has length 123 [2018-12-31 11:01:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 11:01:34,839 INFO L480 AbstractCegarLoop]: Abstraction has 17652 states and 19892 transitions. [2018-12-31 11:01:34,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 11:01:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 17652 states and 19892 transitions. [2018-12-31 11:01:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-31 11:01:34,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 11:01:34,842 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 11:01:34,842 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 11:01:34,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 11:01:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash -714291388, now seen corresponding path program 1 times [2018-12-31 11:01:34,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 11:01:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 11:01:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:01:34,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:01:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:01:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:01:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:01:35,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 11:01:35,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 11:01:35,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:01:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:01:36,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 11:01:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 19 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:01:37,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 11:01:37,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 46 [2018-12-31 11:01:37,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-31 11:01:37,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-31 11:01:37,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2018-12-31 11:01:37,854 INFO L87 Difference]: Start difference. First operand 17652 states and 19892 transitions. Second operand 46 states. [2018-12-31 11:01:44,701 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2018-12-31 11:01:44,930 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-12-31 11:01:45,874 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-12-31 11:01:47,480 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-31 11:01:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 11:01:55,683 INFO L93 Difference]: Finished difference Result 25879 states and 29064 transitions. [2018-12-31 11:01:55,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-31 11:01:55,684 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 123 [2018-12-31 11:01:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 11:01:55,704 INFO L225 Difference]: With dead ends: 25879 [2018-12-31 11:01:55,704 INFO L226 Difference]: Without dead ends: 20973 [2018-12-31 11:01:55,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2790 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1177, Invalid=9125, Unknown=0, NotChecked=0, Total=10302 [2018-12-31 11:01:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20973 states. [2018-12-31 11:02:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20973 to 18430. [2018-12-31 11:02:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18430 states. [2018-12-31 11:02:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18430 states to 18430 states and 20766 transitions. [2018-12-31 11:02:02,787 INFO L78 Accepts]: Start accepts. Automaton has 18430 states and 20766 transitions. Word has length 123 [2018-12-31 11:02:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 11:02:02,787 INFO L480 AbstractCegarLoop]: Abstraction has 18430 states and 20766 transitions. [2018-12-31 11:02:02,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-31 11:02:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 18430 states and 20766 transitions. [2018-12-31 11:02:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-31 11:02:02,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 11:02:02,791 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 11:02:02,791 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 11:02:02,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 11:02:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1776651436, now seen corresponding path program 1 times [2018-12-31 11:02:02,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 11:02:02,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 11:02:02,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:02:02,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:02:02,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:02:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:02:03,110 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-12-31 11:02:03,358 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-12-31 11:02:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:02:03,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 11:02:03,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 11:02:03,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:02:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:02:03,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 11:02:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 36 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:02:04,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 11:02:04,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-12-31 11:02:04,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-31 11:02:04,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-31 11:02:04,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2018-12-31 11:02:04,913 INFO L87 Difference]: Start difference. First operand 18430 states and 20766 transitions. Second operand 34 states. [2018-12-31 11:02:09,365 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-31 11:02:10,646 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-12-31 11:02:11,495 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-12-31 11:02:11,905 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-12-31 11:02:12,064 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2018-12-31 11:02:12,613 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-12-31 11:02:13,157 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-12-31 11:02:13,462 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-12-31 11:02:16,021 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-31 11:02:16,265 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-31 11:02:17,109 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-31 11:02:17,573 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-31 11:02:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 11:02:37,798 INFO L93 Difference]: Finished difference Result 37033 states and 41614 transitions. [2018-12-31 11:02:37,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-31 11:02:37,800 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 123 [2018-12-31 11:02:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 11:02:37,830 INFO L225 Difference]: With dead ends: 37033 [2018-12-31 11:02:37,830 INFO L226 Difference]: Without dead ends: 33586 [2018-12-31 11:02:37,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5353 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=1820, Invalid=16268, Unknown=2, NotChecked=0, Total=18090 [2018-12-31 11:02:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33586 states. [2018-12-31 11:02:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33586 to 21906. [2018-12-31 11:02:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21906 states. [2018-12-31 11:02:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21906 states to 21906 states and 24627 transitions. [2018-12-31 11:02:46,354 INFO L78 Accepts]: Start accepts. Automaton has 21906 states and 24627 transitions. Word has length 123 [2018-12-31 11:02:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 11:02:46,354 INFO L480 AbstractCegarLoop]: Abstraction has 21906 states and 24627 transitions. [2018-12-31 11:02:46,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-31 11:02:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 21906 states and 24627 transitions. [2018-12-31 11:02:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-31 11:02:46,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 11:02:46,358 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 11:02:46,358 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 11:02:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 11:02:46,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1354284566, now seen corresponding path program 2 times [2018-12-31 11:02:46,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 11:02:46,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 11:02:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:02:46,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:02:46,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:02:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:02:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 36 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 11:02:47,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 11:02:47,276 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 11:02:47,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 11:02:47,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 11:02:47,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 11:02:47,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 11:02:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-31 11:02:48,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 11:02:48,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2018-12-31 11:02:48,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-31 11:02:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-31 11:02:48,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-12-31 11:02:48,141 INFO L87 Difference]: Start difference. First operand 21906 states and 24627 transitions. Second operand 25 states. [2018-12-31 11:02:48,954 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2018-12-31 11:02:49,304 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-12-31 11:02:49,629 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2018-12-31 11:02:49,786 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2018-12-31 11:02:50,091 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-12-31 11:02:50,429 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2018-12-31 11:02:50,912 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-12-31 11:02:51,347 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2018-12-31 11:02:51,936 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-12-31 11:02:52,197 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-12-31 11:02:52,357 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2018-12-31 11:02:52,555 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-12-31 11:02:52,738 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-12-31 11:02:52,905 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-12-31 11:02:53,150 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2018-12-31 11:02:53,300 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-12-31 11:02:53,692 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2018-12-31 11:02:53,931 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-12-31 11:02:54,170 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-12-31 11:02:54,531 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2018-12-31 11:02:54,871 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-12-31 11:02:55,248 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2018-12-31 11:02:55,485 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-12-31 11:02:55,699 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2018-12-31 11:02:56,176 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-31 11:02:56,368 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-12-31 11:02:56,870 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2018-12-31 11:02:57,222 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2018-12-31 11:02:57,398 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-31 11:02:57,562 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2018-12-31 11:02:57,950 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-31 11:02:58,091 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2018-12-31 11:02:58,646 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-12-31 11:02:58,901 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2018-12-31 11:02:59,290 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-12-31 11:02:59,556 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-31 11:02:59,826 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2018-12-31 11:03:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 11:03:07,630 INFO L93 Difference]: Finished difference Result 27953 states and 31416 transitions. [2018-12-31 11:03:07,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-31 11:03:07,630 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 123 [2018-12-31 11:03:07,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 11:03:07,648 INFO L225 Difference]: With dead ends: 27953 [2018-12-31 11:03:07,648 INFO L226 Difference]: Without dead ends: 20009 [2018-12-31 11:03:07,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1420, Invalid=8086, Unknown=0, NotChecked=0, Total=9506 [2018-12-31 11:03:07,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20009 states. [2018-12-31 11:03:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20009 to 17477. [2018-12-31 11:03:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17477 states. [2018-12-31 11:03:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17477 states to 17477 states and 19600 transitions. [2018-12-31 11:03:14,318 INFO L78 Accepts]: Start accepts. Automaton has 17477 states and 19600 transitions. Word has length 123 [2018-12-31 11:03:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 11:03:14,318 INFO L480 AbstractCegarLoop]: Abstraction has 17477 states and 19600 transitions. [2018-12-31 11:03:14,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-31 11:03:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 17477 states and 19600 transitions. [2018-12-31 11:03:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-31 11:03:14,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 11:03:14,323 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 11:03:14,323 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 11:03:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 11:03:14,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1083043294, now seen corresponding path program 1 times [2018-12-31 11:03:14,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 11:03:14,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 11:03:14,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:03:14,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 11:03:14,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:03:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:03:14,676 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-12-31 11:03:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 103 proven. 129 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 11:03:14,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 11:03:14,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 11:03:14,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:03:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 11:03:15,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 11:03:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 152 proven. 21 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-31 11:03:15,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 11:03:15,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-12-31 11:03:15,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-31 11:03:15,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-31 11:03:15,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-12-31 11:03:15,554 INFO L87 Difference]: Start difference. First operand 17477 states and 19600 transitions. Second operand 27 states. [2018-12-31 11:03:15,759 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 11:03:17,056 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-12-31 11:03:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 11:03:30,530 INFO L93 Difference]: Finished difference Result 29583 states and 33169 transitions. [2018-12-31 11:03:30,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-31 11:03:30,531 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 148 [2018-12-31 11:03:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 11:03:30,562 INFO L225 Difference]: With dead ends: 29583 [2018-12-31 11:03:30,563 INFO L226 Difference]: Without dead ends: 28462 [2018-12-31 11:03:30,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=542, Invalid=2320, Unknown=0, NotChecked=0, Total=2862 [2018-12-31 11:03:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28462 states. [2018-12-31 11:03:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28462 to 18524. [2018-12-31 11:03:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2018-12-31 11:03:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 20756 transitions. [2018-12-31 11:03:37,859 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 20756 transitions. Word has length 148 [2018-12-31 11:03:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 11:03:37,859 INFO L480 AbstractCegarLoop]: Abstraction has 18524 states and 20756 transitions. [2018-12-31 11:03:37,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-31 11:03:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 20756 transitions. [2018-12-31 11:03:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-31 11:03:37,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 11:03:37,864 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 11:03:37,864 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 11:03:37,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 11:03:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2044509292, now seen corresponding path program 1 times [2018-12-31 11:03:37,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 11:03:37,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 11:03:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:03:37,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 11:03:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 11:03:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 11:03:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 11:03:37,999 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 11:03:38,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 11:03:38 BoogieIcfgContainer [2018-12-31 11:03:38,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 11:03:38,213 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 11:03:38,213 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 11:03:38,214 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 11:03:38,217 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:51:12" (3/4) ... [2018-12-31 11:03:38,221 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 11:03:38,398 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 11:03:38,399 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 11:03:38,405 INFO L168 Benchmark]: Toolchain (without parser) took 747388.49 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.9 GB). Free memory was 948.7 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-12-31 11:03:38,405 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 11:03:38,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.36 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 931.2 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-12-31 11:03:38,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-31 11:03:38,408 INFO L168 Benchmark]: Boogie Preprocessor took 34.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 11:03:38,408 INFO L168 Benchmark]: RCFGBuilder took 1014.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-12-31 11:03:38,408 INFO L168 Benchmark]: TraceAbstraction took 745597.78 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-31 11:03:38,408 INFO L168 Benchmark]: Witness Printer took 185.57 ms. Allocated memory is still 5.9 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 80.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. [2018-12-31 11:03:38,412 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 417.36 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 931.2 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1014.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 745597.78 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 185.57 ms. Allocated memory is still 5.9 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 80.7 MB). Peak memory consumption was 80.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 352]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] char r1 ; [L72] port_t p1 ; [L73] char p1_old ; [L74] char p1_new ; [L75] char id1 ; [L76] char st1 ; [L77] msg_t send1 ; [L78] _Bool mode1 ; [L79] _Bool alive1 ; [L80] port_t p2 ; [L81] char p2_old ; [L82] char p2_new ; [L83] char id2 ; [L84] char st2 ; [L85] msg_t send2 ; [L86] _Bool mode2 ; [L87] _Bool alive2 ; [L88] port_t p3 ; [L89] char p3_old ; [L90] char p3_new ; [L91] char id3 ; [L92] char st3 ; [L93] msg_t send3 ; [L94] _Bool mode3 ; [L95] _Bool alive3 ; [L196] void (*nodes[3])(void) = { & node1, & node2, & node3}; VAL [alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L296] int c1 ; [L297] int i2 ; [L300] c1 = 0 [L301] r1 = __VERIFIER_nondet_char() [L302] id1 = __VERIFIER_nondet_char() [L303] st1 = __VERIFIER_nondet_char() [L304] send1 = __VERIFIER_nondet_char() [L305] mode1 = __VERIFIER_nondet_bool() [L306] alive1 = __VERIFIER_nondet_bool() [L307] id2 = __VERIFIER_nondet_char() [L308] st2 = __VERIFIER_nondet_char() [L309] send2 = __VERIFIER_nondet_char() [L310] mode2 = __VERIFIER_nondet_bool() [L311] alive2 = __VERIFIER_nondet_bool() [L312] id3 = __VERIFIER_nondet_char() [L313] st3 = __VERIFIER_nondet_char() [L314] send3 = __VERIFIER_nondet_char() [L315] mode3 = __VERIFIER_nondet_bool() [L316] alive3 = __VERIFIER_nondet_bool() [L199] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L202] COND TRUE (int )r1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L203] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L206] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L207] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L208] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L209] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L211] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L213] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L215] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L216] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L217] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L218] COND TRUE (int )id2 != (int )id3 [L219] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L271] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L317] i2 = init() [L319] p1_old = nomsg [L320] p1_new = nomsg [L321] p2_old = nomsg [L322] p2_new = nomsg [L323] p3_old = nomsg [L324] p3_new = nomsg [L325] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L283] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L286] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L352] __VERIFIER_error() VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 1 error locations. UNSAFE Result, 745.5s OverallTime, 41 OverallIterations, 6 TraceHistogramMax, 546.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7406 SDtfs, 40338 SDslu, 74776 SDs, 0 SdLazy, 34231 SolverSat, 2931 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 60.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4037 GetRequests, 1910 SyntacticMatches, 12 SemanticMatches, 2115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234530 ImplicationChecksByTransitivity, 252.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91633occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 165.6s AutomataMinimizationTime, 40 MinimizatonAttempts, 514874 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 5408 NumberOfCodeBlocks, 5408 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 5200 ConstructedInterpolants, 520 QuantifiedInterpolants, 6354599 SizeOfPredicates, 93 NumberOfNonLiveVariables, 7896 ConjunctsInSsa, 377 ConjunctsInUnsatCore, 60 InterpolantComputations, 20 PerfectInterpolantSequences, 1706/3101 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...