./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer --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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:52:20,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:52:20,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:52:20,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:52:20,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:52:20,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:52:20,118 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:52:20,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:52:20,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:52:20,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:52:20,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:52:20,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:52:20,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:52:20,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:52:20,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:52:20,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:52:20,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:52:20,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:52:20,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:52:20,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:52:20,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:52:20,126 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:52:20,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:52:20,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:52:20,128 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:52:20,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:52:20,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:52:20,129 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:52:20,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:52:20,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:52:20,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:52:20,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:52:20,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:52:20,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:52:20,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:52:20,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:52:20,132 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 00:52:20,139 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:52:20,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:52:20,139 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:52:20,139 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:52:20,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:52:20,140 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:52:20,140 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:52:20,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:52:20,140 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:52:20,140 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:52:20,140 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:52:20,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:52:20,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:52:20,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:52:20,141 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:52:20,141 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:52:20,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:52:20,141 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:52:20,141 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:52:20,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:52:20,142 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:52:20,142 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:52:20,142 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:52:20,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:52:20,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:52:20,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:52:20,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:52:20,142 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:52:20,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:52:20,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:52:20,143 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-12-09 00:52:20,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:52:20,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:52:20,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:52:20,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:52:20,174 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:52:20,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 00:52:20,214 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/data/a36ba3e7c/01d32ed9bedf4c7ab65000eadf807c85/FLAGaa96b1d5c [2018-12-09 00:52:20,648 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:52:20,649 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 00:52:20,653 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/data/a36ba3e7c/01d32ed9bedf4c7ab65000eadf807c85/FLAGaa96b1d5c [2018-12-09 00:52:20,662 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/data/a36ba3e7c/01d32ed9bedf4c7ab65000eadf807c85 [2018-12-09 00:52:20,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:52:20,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:52:20,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:52:20,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:52:20,668 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:52:20,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89eb684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20, skipping insertion in model container [2018-12-09 00:52:20,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:52:20,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:52:20,778 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:52:20,780 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:52:20,795 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:52:20,803 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:52:20,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20 WrapperNode [2018-12-09 00:52:20,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:52:20,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:52:20,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:52:20,804 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:52:20,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:52:20,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:52:20,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:52:20,816 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:52:20,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... [2018-12-09 00:52:20,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:52:20,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:52:20,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:52:20,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:52:20,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:52:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:52:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:52:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:52:20,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:52:20,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:52:20,897 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:52:21,035 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:52:21,035 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 00:52:21,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:52:21 BoogieIcfgContainer [2018-12-09 00:52:21,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:52:21,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:52:21,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:52:21,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:52:21,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:52:20" (1/3) ... [2018-12-09 00:52:21,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3620794c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:52:21, skipping insertion in model container [2018-12-09 00:52:21,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:20" (2/3) ... [2018-12-09 00:52:21,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3620794c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:52:21, skipping insertion in model container [2018-12-09 00:52:21,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:52:21" (3/3) ... [2018-12-09 00:52:21,041 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 00:52:21,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:52:21,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:52:21,059 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:52:21,076 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:52:21,076 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:52:21,076 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:52:21,077 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:52:21,077 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:52:21,077 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:52:21,077 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:52:21,077 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:52:21,077 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:52:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-09 00:52:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:52:21,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,093 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] [2018-12-09 00:52:21,094 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-12-09 00:52:21,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,201 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-09 00:52:21,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,214 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-12-09 00:52:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,247 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-12-09 00:52:21,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 00:52:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,255 INFO L225 Difference]: With dead ends: 99 [2018-12-09 00:52:21,256 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 00:52:21,257 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-09 00:52:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 00:52:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-12-09 00:52:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 00:52:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-12-09 00:52:21,282 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-12-09 00:52:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,282 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-12-09 00:52:21,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-12-09 00:52:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:52:21,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,283 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] [2018-12-09 00:52:21,283 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-12-09 00:52:21,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,322 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-09 00:52:21,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,325 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-12-09 00:52:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,346 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-12-09 00:52:21,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 00:52:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,347 INFO L225 Difference]: With dead ends: 137 [2018-12-09 00:52:21,347 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 00:52:21,348 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-09 00:52:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 00:52:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-12-09 00:52:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 00:52:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-12-09 00:52:21,353 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-12-09 00:52:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,353 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-12-09 00:52:21,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,353 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-12-09 00:52:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:52:21,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,354 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-09 00:52:21,354 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-12-09 00:52:21,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,382 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-09 00:52:21,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,383 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-12-09 00:52:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,402 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-12-09 00:52:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 00:52:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,403 INFO L225 Difference]: With dead ends: 126 [2018-12-09 00:52:21,403 INFO L226 Difference]: Without dead ends: 87 [2018-12-09 00:52:21,404 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-09 00:52:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-09 00:52:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-12-09 00:52:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 00:52:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-12-09 00:52:21,410 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-12-09 00:52:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,410 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-12-09 00:52:21,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-12-09 00:52:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:52:21,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,411 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-09 00:52:21,411 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-12-09 00:52:21,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,434 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-09 00:52:21,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,435 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-12-09 00:52:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,444 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-12-09 00:52:21,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 00:52:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,445 INFO L225 Difference]: With dead ends: 160 [2018-12-09 00:52:21,445 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 00:52:21,445 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-09 00:52:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 00:52:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-12-09 00:52:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 00:52:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-12-09 00:52:21,450 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-12-09 00:52:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,450 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-12-09 00:52:21,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-12-09 00:52:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:52:21,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,451 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-09 00:52:21,451 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-12-09 00:52:21,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,475 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-09 00:52:21,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,476 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-12-09 00:52:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,491 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-12-09 00:52:21,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 00:52:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,492 INFO L225 Difference]: With dead ends: 264 [2018-12-09 00:52:21,492 INFO L226 Difference]: Without dead ends: 160 [2018-12-09 00:52:21,493 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-09 00:52:21,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-09 00:52:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-12-09 00:52:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-09 00:52:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-12-09 00:52:21,501 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-12-09 00:52:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,501 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-12-09 00:52:21,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-12-09 00:52:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:52:21,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,502 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] [2018-12-09 00:52:21,502 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-12-09 00:52:21,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,519 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-09 00:52:21,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,520 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-12-09 00:52:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,530 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-12-09 00:52:21,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 00:52:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,531 INFO L225 Difference]: With dead ends: 237 [2018-12-09 00:52:21,531 INFO L226 Difference]: Without dead ends: 162 [2018-12-09 00:52:21,531 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-09 00:52:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-09 00:52:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-12-09 00:52:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-09 00:52:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-12-09 00:52:21,536 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-12-09 00:52:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,536 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-12-09 00:52:21,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-12-09 00:52:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:52:21,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,537 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] [2018-12-09 00:52:21,537 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,537 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-12-09 00:52:21,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,552 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-09 00:52:21,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,553 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-12-09 00:52:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,563 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-12-09 00:52:21,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 00:52:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,565 INFO L225 Difference]: With dead ends: 300 [2018-12-09 00:52:21,565 INFO L226 Difference]: Without dead ends: 298 [2018-12-09 00:52:21,565 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-09 00:52:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-09 00:52:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-12-09 00:52:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-09 00:52:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-12-09 00:52:21,571 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-12-09 00:52:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,571 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-12-09 00:52:21,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-12-09 00:52:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:52:21,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,572 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] [2018-12-09 00:52:21,572 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-12-09 00:52:21,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,584 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-09 00:52:21,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,585 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-12-09 00:52:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,596 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-12-09 00:52:21,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 00:52:21,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,597 INFO L225 Difference]: With dead ends: 512 [2018-12-09 00:52:21,597 INFO L226 Difference]: Without dead ends: 306 [2018-12-09 00:52:21,598 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-09 00:52:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-09 00:52:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-12-09 00:52:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-09 00:52:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-12-09 00:52:21,604 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-12-09 00:52:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,604 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-12-09 00:52:21,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-12-09 00:52:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:52:21,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,605 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] [2018-12-09 00:52:21,605 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-12-09 00:52:21,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,621 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-09 00:52:21,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,622 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-12-09 00:52:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,638 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-12-09 00:52:21,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:52:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,640 INFO L225 Difference]: With dead ends: 456 [2018-12-09 00:52:21,640 INFO L226 Difference]: Without dead ends: 310 [2018-12-09 00:52:21,640 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-09 00:52:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-09 00:52:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-12-09 00:52:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-12-09 00:52:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-12-09 00:52:21,649 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-12-09 00:52:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,649 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-12-09 00:52:21,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-12-09 00:52:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:52:21,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,650 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] [2018-12-09 00:52:21,650 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,650 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-12-09 00:52:21,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,666 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-09 00:52:21,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,667 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-12-09 00:52:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,682 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-12-09 00:52:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:52:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,685 INFO L225 Difference]: With dead ends: 572 [2018-12-09 00:52:21,685 INFO L226 Difference]: Without dead ends: 570 [2018-12-09 00:52:21,686 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-09 00:52:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-12-09 00:52:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-12-09 00:52:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-09 00:52:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-12-09 00:52:21,699 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-12-09 00:52:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,699 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-12-09 00:52:21,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-12-09 00:52:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:52:21,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,701 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] [2018-12-09 00:52:21,701 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-12-09 00:52:21,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,719 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-09 00:52:21,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,721 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-12-09 00:52:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,739 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-12-09 00:52:21,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:52:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,741 INFO L225 Difference]: With dead ends: 1004 [2018-12-09 00:52:21,741 INFO L226 Difference]: Without dead ends: 594 [2018-12-09 00:52:21,742 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-09 00:52:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-12-09 00:52:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-12-09 00:52:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-09 00:52:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-12-09 00:52:21,753 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-12-09 00:52:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,754 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-12-09 00:52:21,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-12-09 00:52:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:52:21,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,755 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] [2018-12-09 00:52:21,755 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-12-09 00:52:21,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,767 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-09 00:52:21,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,768 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-12-09 00:52:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,781 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-12-09 00:52:21,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 00:52:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,783 INFO L225 Difference]: With dead ends: 888 [2018-12-09 00:52:21,783 INFO L226 Difference]: Without dead ends: 602 [2018-12-09 00:52:21,784 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-09 00:52:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-12-09 00:52:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-12-09 00:52:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-09 00:52:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-12-09 00:52:21,795 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-12-09 00:52:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,795 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-12-09 00:52:21,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-12-09 00:52:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:52:21,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,796 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] [2018-12-09 00:52:21,796 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-12-09 00:52:21,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,808 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-09 00:52:21,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,809 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-12-09 00:52:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,831 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-12-09 00:52:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 00:52:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,834 INFO L225 Difference]: With dead ends: 1100 [2018-12-09 00:52:21,835 INFO L226 Difference]: Without dead ends: 1098 [2018-12-09 00:52:21,835 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-09 00:52:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-12-09 00:52:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-12-09 00:52:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-12-09 00:52:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-12-09 00:52:21,851 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-12-09 00:52:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,852 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-12-09 00:52:21,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-12-09 00:52:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:52:21,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,853 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] [2018-12-09 00:52:21,853 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-12-09 00:52:21,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,865 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-09 00:52:21,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,866 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-12-09 00:52:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,885 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-12-09 00:52:21,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 00:52:21,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,887 INFO L225 Difference]: With dead ends: 1980 [2018-12-09 00:52:21,887 INFO L226 Difference]: Without dead ends: 1162 [2018-12-09 00:52:21,888 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-09 00:52:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-12-09 00:52:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-12-09 00:52:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-12-09 00:52:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-12-09 00:52:21,909 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-12-09 00:52:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,909 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-12-09 00:52:21,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-12-09 00:52:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:52:21,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,910 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] [2018-12-09 00:52:21,910 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,911 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-12-09 00:52:21,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,920 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-09 00:52:21,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,921 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-12-09 00:52:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:21,951 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-12-09 00:52:21,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:21,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:52:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:21,955 INFO L225 Difference]: With dead ends: 1740 [2018-12-09 00:52:21,955 INFO L226 Difference]: Without dead ends: 1178 [2018-12-09 00:52:21,956 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-09 00:52:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-12-09 00:52:21,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-12-09 00:52:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-12-09 00:52:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-12-09 00:52:21,985 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-12-09 00:52:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:21,986 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-12-09 00:52:21,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-12-09 00:52:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:52:21,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:21,987 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] [2018-12-09 00:52:21,987 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:21,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:21,987 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-12-09 00:52:21,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:21,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:21,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:21,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:21,997 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-09 00:52:21,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:21,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:21,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:21,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:21,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:21,998 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-12-09 00:52:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:22,028 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-12-09 00:52:22,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:22,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:52:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:22,033 INFO L225 Difference]: With dead ends: 2124 [2018-12-09 00:52:22,033 INFO L226 Difference]: Without dead ends: 2122 [2018-12-09 00:52:22,034 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-09 00:52:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-12-09 00:52:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-12-09 00:52:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-12-09 00:52:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-12-09 00:52:22,067 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-12-09 00:52:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:22,068 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-12-09 00:52:22,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-12-09 00:52:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:52:22,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:22,069 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] [2018-12-09 00:52:22,069 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:22,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-12-09 00:52:22,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:22,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:22,078 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-09 00:52:22,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:22,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:22,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:22,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:22,079 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-12-09 00:52:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:22,108 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-12-09 00:52:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:22,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:52:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:22,112 INFO L225 Difference]: With dead ends: 3916 [2018-12-09 00:52:22,112 INFO L226 Difference]: Without dead ends: 2282 [2018-12-09 00:52:22,114 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-09 00:52:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-12-09 00:52:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-12-09 00:52:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-12-09 00:52:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-12-09 00:52:22,148 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-12-09 00:52:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:22,148 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-12-09 00:52:22,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-12-09 00:52:22,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:52:22,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:22,149 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] [2018-12-09 00:52:22,149 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:22,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:22,150 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-12-09 00:52:22,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:22,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:22,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:22,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:22,160 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-09 00:52:22,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:22,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:22,161 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-12-09 00:52:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:22,187 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-12-09 00:52:22,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:22,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 00:52:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:22,191 INFO L225 Difference]: With dead ends: 3420 [2018-12-09 00:52:22,192 INFO L226 Difference]: Without dead ends: 2314 [2018-12-09 00:52:22,193 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-09 00:52:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-12-09 00:52:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-12-09 00:52:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-12-09 00:52:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-12-09 00:52:22,229 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-12-09 00:52:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:22,229 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-12-09 00:52:22,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-12-09 00:52:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:52:22,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:22,230 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] [2018-12-09 00:52:22,230 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:22,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-12-09 00:52:22,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:22,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:22,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:22,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:22,246 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-09 00:52:22,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:22,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:22,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:22,247 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-12-09 00:52:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:22,283 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-12-09 00:52:22,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:22,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 00:52:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:22,290 INFO L225 Difference]: With dead ends: 4108 [2018-12-09 00:52:22,291 INFO L226 Difference]: Without dead ends: 4106 [2018-12-09 00:52:22,292 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-09 00:52:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-12-09 00:52:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-12-09 00:52:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-12-09 00:52:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-12-09 00:52:22,342 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-12-09 00:52:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:22,342 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-12-09 00:52:22,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-12-09 00:52:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:52:22,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:22,344 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] [2018-12-09 00:52:22,344 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:22,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:22,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-12-09 00:52:22,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:22,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:22,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:22,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:22,353 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-09 00:52:22,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:22,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:22,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:22,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:22,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:22,354 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-12-09 00:52:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:22,402 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-12-09 00:52:22,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:22,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 00:52:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:22,410 INFO L225 Difference]: With dead ends: 7756 [2018-12-09 00:52:22,410 INFO L226 Difference]: Without dead ends: 4490 [2018-12-09 00:52:22,413 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-09 00:52:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-12-09 00:52:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-12-09 00:52:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-12-09 00:52:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-12-09 00:52:22,484 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-12-09 00:52:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:22,485 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-12-09 00:52:22,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-12-09 00:52:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:52:22,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:22,487 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] [2018-12-09 00:52:22,487 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:22,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-12-09 00:52:22,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:22,496 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-09 00:52:22,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:22,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:22,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:22,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:22,497 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-12-09 00:52:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:22,556 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-12-09 00:52:22,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:22,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 00:52:22,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:22,567 INFO L225 Difference]: With dead ends: 6732 [2018-12-09 00:52:22,567 INFO L226 Difference]: Without dead ends: 4554 [2018-12-09 00:52:22,570 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-09 00:52:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-12-09 00:52:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-12-09 00:52:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-12-09 00:52:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-12-09 00:52:22,638 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-12-09 00:52:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:22,638 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-12-09 00:52:22,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-12-09 00:52:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:52:22,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:22,640 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] [2018-12-09 00:52:22,640 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:22,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-12-09 00:52:22,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:22,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:22,655 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-09 00:52:22,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:22,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:22,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:22,656 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-12-09 00:52:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:22,740 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-12-09 00:52:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:22,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 00:52:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:22,755 INFO L225 Difference]: With dead ends: 13260 [2018-12-09 00:52:22,755 INFO L226 Difference]: Without dead ends: 8842 [2018-12-09 00:52:22,763 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-09 00:52:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-12-09 00:52:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-12-09 00:52:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-12-09 00:52:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-12-09 00:52:22,900 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-12-09 00:52:22,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:22,900 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-12-09 00:52:22,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-12-09 00:52:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:52:22,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:22,904 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] [2018-12-09 00:52:22,904 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:22,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:22,905 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-12-09 00:52:22,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:22,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:22,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:22,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:22,915 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-09 00:52:22,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:22,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:22,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:22,916 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-12-09 00:52:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:22,999 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-12-09 00:52:23,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:23,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 00:52:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:23,011 INFO L225 Difference]: With dead ends: 10124 [2018-12-09 00:52:23,011 INFO L226 Difference]: Without dead ends: 10122 [2018-12-09 00:52:23,014 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-09 00:52:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-12-09 00:52:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-12-09 00:52:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-12-09 00:52:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-12-09 00:52:23,144 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-12-09 00:52:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:23,144 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-12-09 00:52:23,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-12-09 00:52:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 00:52:23,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:23,149 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] [2018-12-09 00:52:23,149 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:23,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-12-09 00:52:23,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:23,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:23,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:23,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:23,158 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-09 00:52:23,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:23,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:23,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:23,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:23,158 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-12-09 00:52:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:23,258 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-12-09 00:52:23,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:23,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 00:52:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:23,274 INFO L225 Difference]: With dead ends: 15244 [2018-12-09 00:52:23,274 INFO L226 Difference]: Without dead ends: 15242 [2018-12-09 00:52:23,277 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-09 00:52:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-12-09 00:52:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-12-09 00:52:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-12-09 00:52:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-12-09 00:52:23,424 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-12-09 00:52:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:23,425 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-12-09 00:52:23,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-12-09 00:52:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 00:52:23,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:23,431 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] [2018-12-09 00:52:23,431 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:23,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:23,431 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-12-09 00:52:23,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:23,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:23,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:23,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:23,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:23,439 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-09 00:52:23,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:23,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:23,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:23,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:23,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:23,440 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2018-12-09 00:52:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:23,581 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2018-12-09 00:52:23,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:23,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 00:52:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:23,595 INFO L225 Difference]: With dead ends: 30348 [2018-12-09 00:52:23,595 INFO L226 Difference]: Without dead ends: 17290 [2018-12-09 00:52:23,604 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-09 00:52:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-12-09 00:52:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2018-12-09 00:52:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2018-12-09 00:52:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2018-12-09 00:52:23,806 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2018-12-09 00:52:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:23,806 INFO L480 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2018-12-09 00:52:23,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2018-12-09 00:52:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:52:23,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:23,812 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] [2018-12-09 00:52:23,812 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:23,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2018-12-09 00:52:23,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:23,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:23,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:23,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:23,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:23,821 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-09 00:52:23,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:23,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:23,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:23,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:23,821 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2018-12-09 00:52:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:23,949 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2018-12-09 00:52:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:23,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 00:52:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:23,966 INFO L225 Difference]: With dead ends: 26124 [2018-12-09 00:52:23,966 INFO L226 Difference]: Without dead ends: 17674 [2018-12-09 00:52:23,975 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-09 00:52:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2018-12-09 00:52:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2018-12-09 00:52:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2018-12-09 00:52:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2018-12-09 00:52:24,219 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2018-12-09 00:52:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:24,220 INFO L480 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2018-12-09 00:52:24,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2018-12-09 00:52:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:52:24,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:24,226 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] [2018-12-09 00:52:24,226 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:24,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:24,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2018-12-09 00:52:24,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:24,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:24,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:24,239 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-09 00:52:24,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:24,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:24,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:24,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:24,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:24,240 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2018-12-09 00:52:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:24,462 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2018-12-09 00:52:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:24,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 00:52:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:24,485 INFO L225 Difference]: With dead ends: 29708 [2018-12-09 00:52:24,485 INFO L226 Difference]: Without dead ends: 29706 [2018-12-09 00:52:24,491 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-09 00:52:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2018-12-09 00:52:24,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2018-12-09 00:52:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2018-12-09 00:52:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2018-12-09 00:52:24,797 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2018-12-09 00:52:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:24,797 INFO L480 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2018-12-09 00:52:24,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2018-12-09 00:52:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:52:24,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:24,809 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] [2018-12-09 00:52:24,810 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:24,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2018-12-09 00:52:24,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:24,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:24,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:24,820 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-09 00:52:24,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:24,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:24,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:24,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:24,821 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2018-12-09 00:52:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:25,117 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2018-12-09 00:52:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:25,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 00:52:25,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:25,139 INFO L225 Difference]: With dead ends: 60428 [2018-12-09 00:52:25,139 INFO L226 Difference]: Without dead ends: 34314 [2018-12-09 00:52:25,159 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-09 00:52:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2018-12-09 00:52:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2018-12-09 00:52:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2018-12-09 00:52:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2018-12-09 00:52:25,637 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2018-12-09 00:52:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:25,638 INFO L480 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2018-12-09 00:52:25,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2018-12-09 00:52:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 00:52:25,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:25,648 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] [2018-12-09 00:52:25,648 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:25,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:25,648 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2018-12-09 00:52:25,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:25,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:25,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:25,666 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-09 00:52:25,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:25,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:25,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:25,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:25,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:25,667 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2018-12-09 00:52:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:25,926 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2018-12-09 00:52:25,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:25,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 00:52:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:25,949 INFO L225 Difference]: With dead ends: 51468 [2018-12-09 00:52:25,949 INFO L226 Difference]: Without dead ends: 34826 [2018-12-09 00:52:25,963 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-09 00:52:25,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2018-12-09 00:52:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2018-12-09 00:52:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2018-12-09 00:52:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2018-12-09 00:52:26,446 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2018-12-09 00:52:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:26,446 INFO L480 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2018-12-09 00:52:26,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2018-12-09 00:52:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 00:52:26,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:26,456 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] [2018-12-09 00:52:26,456 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:26,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:26,457 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2018-12-09 00:52:26,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:26,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:26,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:26,478 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-09 00:52:26,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:26,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:26,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:26,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:26,479 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2018-12-09 00:52:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:26,914 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2018-12-09 00:52:26,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:26,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 00:52:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:26,952 INFO L225 Difference]: With dead ends: 57356 [2018-12-09 00:52:26,952 INFO L226 Difference]: Without dead ends: 57354 [2018-12-09 00:52:26,960 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-09 00:52:26,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2018-12-09 00:52:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2018-12-09 00:52:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2018-12-09 00:52:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2018-12-09 00:52:27,609 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2018-12-09 00:52:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:27,609 INFO L480 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2018-12-09 00:52:27,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2018-12-09 00:52:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 00:52:27,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:27,633 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] [2018-12-09 00:52:27,633 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:27,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:27,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2018-12-09 00:52:27,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:27,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:27,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:27,647 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-09 00:52:27,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:27,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:27,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:27,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:27,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:27,648 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2018-12-09 00:52:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:28,228 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2018-12-09 00:52:28,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:28,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 00:52:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:28,284 INFO L225 Difference]: With dead ends: 119820 [2018-12-09 00:52:28,284 INFO L226 Difference]: Without dead ends: 67594 [2018-12-09 00:52:28,320 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-09 00:52:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2018-12-09 00:52:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2018-12-09 00:52:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2018-12-09 00:52:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2018-12-09 00:52:29,300 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2018-12-09 00:52:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:29,300 INFO L480 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2018-12-09 00:52:29,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2018-12-09 00:52:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:52:29,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:29,325 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] [2018-12-09 00:52:29,325 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:29,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:29,325 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2018-12-09 00:52:29,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:29,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:29,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:29,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:29,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:29,348 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-09 00:52:29,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:29,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:29,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:29,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:29,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:29,349 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2018-12-09 00:52:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:29,988 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2018-12-09 00:52:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:29,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 00:52:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:30,032 INFO L225 Difference]: With dead ends: 101388 [2018-12-09 00:52:30,032 INFO L226 Difference]: Without dead ends: 68618 [2018-12-09 00:52:30,051 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-09 00:52:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2018-12-09 00:52:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2018-12-09 00:52:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2018-12-09 00:52:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2018-12-09 00:52:30,956 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2018-12-09 00:52:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:30,956 INFO L480 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2018-12-09 00:52:30,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2018-12-09 00:52:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:52:30,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:30,979 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] [2018-12-09 00:52:30,979 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:30,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2018-12-09 00:52:30,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:30,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:30,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:30,999 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-09 00:52:30,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:30,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:30,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:31,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:31,000 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2018-12-09 00:52:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:32,013 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2018-12-09 00:52:32,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:32,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 00:52:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:32,087 INFO L225 Difference]: With dead ends: 110602 [2018-12-09 00:52:32,087 INFO L226 Difference]: Without dead ends: 110600 [2018-12-09 00:52:32,099 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-09 00:52:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2018-12-09 00:52:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2018-12-09 00:52:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2018-12-09 00:52:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2018-12-09 00:52:33,425 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2018-12-09 00:52:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:33,425 INFO L480 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2018-12-09 00:52:33,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2018-12-09 00:52:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:52:33,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:52:33,471 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] [2018-12-09 00:52:33,471 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:52:33,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:52:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2018-12-09 00:52:33,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:52:33,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:52:33,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:33,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:52:33,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:52:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:52:33,481 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-09 00:52:33,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:52:33,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:52:33,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:52:33,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:52:33,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:52:33,482 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2018-12-09 00:52:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:52:34,766 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2018-12-09 00:52:34,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:52:34,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 00:52:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:52:34,766 INFO L225 Difference]: With dead ends: 237576 [2018-12-09 00:52:34,766 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:52:34,865 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-09 00:52:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:52:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:52:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:52:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:52:34,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-09 00:52:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:52:34,866 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:52:34,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:52:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:52:34,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:52:34,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:52:34,903 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 00:52:34,903 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 00:52:34,904 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-12-09 00:52:34,904 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-12-09 00:52:34,905 INFO L451 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L451 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-12-09 00:52:34,905 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-12-09 00:52:34,905 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-12-09 00:52:34,906 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-12-09 00:52:34,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:52:34 BoogieIcfgContainer [2018-12-09 00:52:34,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:52:34,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:52:34,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:52:34,911 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:52:34,911 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:52:21" (3/4) ... [2018-12-09 00:52:34,914 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:52:34,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:52:34,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:52:34,923 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 00:52:34,923 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 00:52:34,923 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 00:52:34,958 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c99d9b6c-03c7-4175-ba4d-a0f2a0220e0a/bin-2019/uautomizer/witness.graphml [2018-12-09 00:52:34,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:52:34,959 INFO L168 Benchmark]: Toolchain (without parser) took 14294.46 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 957.1 MB in the beginning and 625.6 MB in the end (delta: 331.5 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-09 00:52:34,960 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:52:34,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.92 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:52:34,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.60 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:52:34,960 INFO L168 Benchmark]: Boogie Preprocessor took 47.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:52:34,960 INFO L168 Benchmark]: RCFGBuilder took 172.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:52:34,961 INFO L168 Benchmark]: TraceAbstraction took 13874.66 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 626.1 MB in the end (delta: 469.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-09 00:52:34,961 INFO L168 Benchmark]: Witness Printer took 47.53 ms. Allocated memory is still 2.6 GB. Free memory was 626.1 MB in the beginning and 625.6 MB in the end (delta: 499.8 kB). Peak memory consumption was 499.8 kB. Max. memory is 11.5 GB. [2018-12-09 00:52:34,962 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.92 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.60 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13874.66 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 626.1 MB in the end (delta: 469.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 47.53 ms. Allocated memory is still 2.6 GB. Free memory was 626.1 MB in the beginning and 625.6 MB in the end (delta: 499.8 kB). Peak memory consumption was 499.8 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 13.8s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, 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: 6.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...