./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:54:51,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:54:51,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:54:51,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:54:51,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:54:51,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:54:51,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:54:51,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:54:51,598 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:54:51,599 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:54:51,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:54:51,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:54:51,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:54:51,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:54:51,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:54:51,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:54:51,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:54:51,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:54:51,606 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:54:51,607 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:54:51,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:54:51,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:54:51,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:54:51,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:54:51,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:54:51,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:54:51,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:54:51,612 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:54:51,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:54:51,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:54:51,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:54:51,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:54:51,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:54:51,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:54:51,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:54:51,616 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:54:51,616 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 05:54:51,627 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:54:51,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:54:51,627 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:54:51,628 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:54:51,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:54:51,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:54:51,628 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:54:51,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:54:51,629 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:54:51,629 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:54:51,629 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:54:51,629 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:54:51,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:54:51,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:54:51,630 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:54:51,630 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:54:51,630 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:54:51,630 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:54:51,630 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:54:51,630 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:54:51,630 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:54:51,631 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:54:51,631 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:54:51,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:54:51,631 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:54:51,631 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:54:51,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:54:51,631 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:54:51,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:54:51,632 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_1ababbfd-22de-4302-aa16-bea2c7afc8e6/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-11-10 05:54:51,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:54:51,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:54:51,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:54:51,668 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:54:51,668 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:54:51,669 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 05:54:51,714 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/data/1987c748e/df6087f2108d464d87f159d7fd1865a9/FLAGfdc8fb022 [2018-11-10 05:54:52,117 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:54:52,118 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 05:54:52,124 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/data/1987c748e/df6087f2108d464d87f159d7fd1865a9/FLAGfdc8fb022 [2018-11-10 05:54:52,134 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/data/1987c748e/df6087f2108d464d87f159d7fd1865a9 [2018-11-10 05:54:52,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:54:52,137 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 05:54:52,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:54:52,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:54:52,140 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:54:52,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:54:52" (1/1) ... [2018-11-10 05:54:52,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f4642c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52, skipping insertion in model container [2018-11-10 05:54:52,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:54:52" (1/1) ... [2018-11-10 05:54:52,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:54:52,164 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:54:52,263 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:54:52,266 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:54:52,282 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:54:52,290 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:54:52,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52 WrapperNode [2018-11-10 05:54:52,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:54:52,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:54:52,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:54:52,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:54:52,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2018-11-10 05:54:52,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2018-11-10 05:54:52,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2018-11-10 05:54:52,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2018-11-10 05:54:52,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2018-11-10 05:54:52,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2018-11-10 05:54:52,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... [2018-11-10 05:54:52,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:54:52,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:54:52,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:54:52,315 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:54:52,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/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-11-10 05:54:52,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:54:52,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:54:52,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:54:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 05:54:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 05:54:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:54:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:54:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:54:52,593 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:54:52,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:54:52 BoogieIcfgContainer [2018-11-10 05:54:52,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:54:52,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:54:52,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:54:52,596 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:54:52,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:54:52" (1/3) ... [2018-11-10 05:54:52,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d52346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:54:52, skipping insertion in model container [2018-11-10 05:54:52,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:52" (2/3) ... [2018-11-10 05:54:52,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d52346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:54:52, skipping insertion in model container [2018-11-10 05:54:52,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:54:52" (3/3) ... [2018-11-10 05:54:52,599 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 05:54:52,608 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:54:52,614 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:54:52,630 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:54:52,657 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:54:52,657 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:54:52,657 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:54:52,658 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:54:52,658 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:54:52,658 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:54:52,658 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:54:52,658 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:54:52,658 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:54:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-10 05:54:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 05:54:52,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:52,678 INFO L375 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-11-10 05:54:52,680 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:52,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash -731061561, now seen corresponding path program 1 times [2018-11-10 05:54:52,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:52,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:52,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:52,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:52,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:52,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:52,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:52,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:52,832 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-11-10 05:54:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:52,877 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2018-11-10 05:54:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:52,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 05:54:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:52,886 INFO L225 Difference]: With dead ends: 107 [2018-11-10 05:54:52,886 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 05:54:52,888 INFO L605 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-11-10 05:54:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 05:54:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2018-11-10 05:54:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 05:54:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2018-11-10 05:54:52,917 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2018-11-10 05:54:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:52,917 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2018-11-10 05:54:52,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2018-11-10 05:54:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 05:54:52,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:52,918 INFO L375 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-11-10 05:54:52,918 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:52,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:52,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1752129915, now seen corresponding path program 1 times [2018-11-10 05:54:52,919 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:52,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:52,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:52,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:52,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:52,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:52,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:52,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:52,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:52,965 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand 3 states. [2018-11-10 05:54:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:52,996 INFO L93 Difference]: Finished difference Result 150 states and 275 transitions. [2018-11-10 05:54:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:52,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 05:54:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:52,998 INFO L225 Difference]: With dead ends: 150 [2018-11-10 05:54:52,998 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 05:54:52,999 INFO L605 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-11-10 05:54:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 05:54:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-10 05:54:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 05:54:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 163 transitions. [2018-11-10 05:54:53,007 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 163 transitions. Word has length 24 [2018-11-10 05:54:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,007 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 163 transitions. [2018-11-10 05:54:53,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2018-11-10 05:54:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 05:54:53,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,008 INFO L375 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-11-10 05:54:53,008 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1187859502, now seen corresponding path program 1 times [2018-11-10 05:54:53,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,050 INFO L87 Difference]: Start difference. First operand 90 states and 163 transitions. Second operand 3 states. [2018-11-10 05:54:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,064 INFO L93 Difference]: Finished difference Result 139 states and 247 transitions. [2018-11-10 05:54:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 05:54:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,065 INFO L225 Difference]: With dead ends: 139 [2018-11-10 05:54:53,065 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 05:54:53,066 INFO L605 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-11-10 05:54:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 05:54:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-10 05:54:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 05:54:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2018-11-10 05:54:53,073 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 25 [2018-11-10 05:54:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,074 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2018-11-10 05:54:53,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2018-11-10 05:54:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 05:54:53,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,074 INFO L375 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-11-10 05:54:53,075 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1518759892, now seen corresponding path program 1 times [2018-11-10 05:54:53,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,117 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand 3 states. [2018-11-10 05:54:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,142 INFO L93 Difference]: Finished difference Result 177 states and 317 transitions. [2018-11-10 05:54:53,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 05:54:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,144 INFO L225 Difference]: With dead ends: 177 [2018-11-10 05:54:53,144 INFO L226 Difference]: Without dead ends: 175 [2018-11-10 05:54:53,144 INFO L605 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-11-10 05:54:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-10 05:54:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 123. [2018-11-10 05:54:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 05:54:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 219 transitions. [2018-11-10 05:54:53,151 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 219 transitions. Word has length 25 [2018-11-10 05:54:53,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,151 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 219 transitions. [2018-11-10 05:54:53,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 219 transitions. [2018-11-10 05:54:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 05:54:53,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,152 INFO L375 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-11-10 05:54:53,153 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,153 INFO L82 PathProgramCache]: Analyzing trace with hash 497691538, now seen corresponding path program 1 times [2018-11-10 05:54:53,153 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,185 INFO L87 Difference]: Start difference. First operand 123 states and 219 transitions. Second operand 3 states. [2018-11-10 05:54:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,205 INFO L93 Difference]: Finished difference Result 291 states and 525 transitions. [2018-11-10 05:54:53,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 05:54:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,206 INFO L225 Difference]: With dead ends: 291 [2018-11-10 05:54:53,206 INFO L226 Difference]: Without dead ends: 177 [2018-11-10 05:54:53,207 INFO L605 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-11-10 05:54:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-10 05:54:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-10 05:54:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 05:54:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 311 transitions. [2018-11-10 05:54:53,216 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 311 transitions. Word has length 25 [2018-11-10 05:54:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,216 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 311 transitions. [2018-11-10 05:54:53,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 311 transitions. [2018-11-10 05:54:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 05:54:53,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,217 INFO L375 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-11-10 05:54:53,218 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash -162870854, now seen corresponding path program 1 times [2018-11-10 05:54:53,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,256 INFO L87 Difference]: Start difference. First operand 175 states and 311 transitions. Second operand 3 states. [2018-11-10 05:54:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,266 INFO L93 Difference]: Finished difference Result 262 states and 464 transitions. [2018-11-10 05:54:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 05:54:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,267 INFO L225 Difference]: With dead ends: 262 [2018-11-10 05:54:53,267 INFO L226 Difference]: Without dead ends: 179 [2018-11-10 05:54:53,267 INFO L605 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-11-10 05:54:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-10 05:54:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-10 05:54:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-10 05:54:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 311 transitions. [2018-11-10 05:54:53,274 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 311 transitions. Word has length 26 [2018-11-10 05:54:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,275 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 311 transitions. [2018-11-10 05:54:53,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 311 transitions. [2018-11-10 05:54:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 05:54:53,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,276 INFO L375 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-11-10 05:54:53,276 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1751218756, now seen corresponding path program 1 times [2018-11-10 05:54:53,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,301 INFO L87 Difference]: Start difference. First operand 177 states and 311 transitions. Second operand 3 states. [2018-11-10 05:54:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,322 INFO L93 Difference]: Finished difference Result 333 states and 593 transitions. [2018-11-10 05:54:53,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 05:54:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,323 INFO L225 Difference]: With dead ends: 333 [2018-11-10 05:54:53,323 INFO L226 Difference]: Without dead ends: 331 [2018-11-10 05:54:53,323 INFO L605 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-11-10 05:54:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-10 05:54:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-11-10 05:54:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-10 05:54:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 415 transitions. [2018-11-10 05:54:53,334 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 415 transitions. Word has length 26 [2018-11-10 05:54:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,335 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 415 transitions. [2018-11-10 05:54:53,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 415 transitions. [2018-11-10 05:54:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 05:54:53,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,336 INFO L375 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-11-10 05:54:53,336 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1522680186, now seen corresponding path program 1 times [2018-11-10 05:54:53,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,356 INFO L87 Difference]: Start difference. First operand 237 states and 415 transitions. Second operand 3 states. [2018-11-10 05:54:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,387 INFO L93 Difference]: Finished difference Result 565 states and 997 transitions. [2018-11-10 05:54:53,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 05:54:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,389 INFO L225 Difference]: With dead ends: 565 [2018-11-10 05:54:53,389 INFO L226 Difference]: Without dead ends: 339 [2018-11-10 05:54:53,390 INFO L605 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-11-10 05:54:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-10 05:54:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-11-10 05:54:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-10 05:54:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 587 transitions. [2018-11-10 05:54:53,399 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 587 transitions. Word has length 26 [2018-11-10 05:54:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,400 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 587 transitions. [2018-11-10 05:54:53,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 587 transitions. [2018-11-10 05:54:53,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 05:54:53,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,401 INFO L375 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-11-10 05:54:53,401 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1547006503, now seen corresponding path program 1 times [2018-11-10 05:54:53,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,429 INFO L87 Difference]: Start difference. First operand 337 states and 587 transitions. Second operand 3 states. [2018-11-10 05:54:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,449 INFO L93 Difference]: Finished difference Result 505 states and 877 transitions. [2018-11-10 05:54:53,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 05:54:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,451 INFO L225 Difference]: With dead ends: 505 [2018-11-10 05:54:53,452 INFO L226 Difference]: Without dead ends: 343 [2018-11-10 05:54:53,452 INFO L605 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-11-10 05:54:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-10 05:54:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-11-10 05:54:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-10 05:54:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2018-11-10 05:54:53,461 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 27 [2018-11-10 05:54:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,462 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2018-11-10 05:54:53,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2018-11-10 05:54:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 05:54:53,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,463 INFO L375 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-11-10 05:54:53,463 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,463 INFO L82 PathProgramCache]: Analyzing trace with hash -41341399, now seen corresponding path program 1 times [2018-11-10 05:54:53,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,492 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 3 states. [2018-11-10 05:54:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,513 INFO L93 Difference]: Finished difference Result 637 states and 1113 transitions. [2018-11-10 05:54:53,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 05:54:53,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,516 INFO L225 Difference]: With dead ends: 637 [2018-11-10 05:54:53,517 INFO L226 Difference]: Without dead ends: 635 [2018-11-10 05:54:53,517 INFO L605 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-11-10 05:54:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-11-10 05:54:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 465. [2018-11-10 05:54:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-10 05:54:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 791 transitions. [2018-11-10 05:54:53,531 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 791 transitions. Word has length 27 [2018-11-10 05:54:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,531 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 791 transitions. [2018-11-10 05:54:53,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 791 transitions. [2018-11-10 05:54:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 05:54:53,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,533 INFO L375 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-11-10 05:54:53,533 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1062409753, now seen corresponding path program 1 times [2018-11-10 05:54:53,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,558 INFO L87 Difference]: Start difference. First operand 465 states and 791 transitions. Second operand 3 states. [2018-11-10 05:54:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,582 INFO L93 Difference]: Finished difference Result 1109 states and 1897 transitions. [2018-11-10 05:54:53,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 05:54:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,585 INFO L225 Difference]: With dead ends: 1109 [2018-11-10 05:54:53,586 INFO L226 Difference]: Without dead ends: 659 [2018-11-10 05:54:53,587 INFO L605 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-11-10 05:54:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-10 05:54:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2018-11-10 05:54:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-10 05:54:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1111 transitions. [2018-11-10 05:54:53,606 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1111 transitions. Word has length 27 [2018-11-10 05:54:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,606 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 1111 transitions. [2018-11-10 05:54:53,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1111 transitions. [2018-11-10 05:54:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 05:54:53,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,607 INFO L375 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-11-10 05:54:53,608 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1281369937, now seen corresponding path program 1 times [2018-11-10 05:54:53,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,645 INFO L87 Difference]: Start difference. First operand 657 states and 1111 transitions. Second operand 3 states. [2018-11-10 05:54:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,664 INFO L93 Difference]: Finished difference Result 985 states and 1661 transitions. [2018-11-10 05:54:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 05:54:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,666 INFO L225 Difference]: With dead ends: 985 [2018-11-10 05:54:53,666 INFO L226 Difference]: Without dead ends: 667 [2018-11-10 05:54:53,667 INFO L605 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-11-10 05:54:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-10 05:54:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2018-11-10 05:54:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-10 05:54:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1111 transitions. [2018-11-10 05:54:53,686 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1111 transitions. Word has length 28 [2018-11-10 05:54:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,686 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 1111 transitions. [2018-11-10 05:54:53,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1111 transitions. [2018-11-10 05:54:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 05:54:53,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,688 INFO L375 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-11-10 05:54:53,688 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1425249457, now seen corresponding path program 1 times [2018-11-10 05:54:53,688 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,709 INFO L87 Difference]: Start difference. First operand 665 states and 1111 transitions. Second operand 3 states. [2018-11-10 05:54:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,756 INFO L93 Difference]: Finished difference Result 1933 states and 3225 transitions. [2018-11-10 05:54:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 05:54:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,760 INFO L225 Difference]: With dead ends: 1933 [2018-11-10 05:54:53,760 INFO L226 Difference]: Without dead ends: 1291 [2018-11-10 05:54:53,762 INFO L605 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-11-10 05:54:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-11-10 05:54:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2018-11-10 05:54:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-10 05:54:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2119 transitions. [2018-11-10 05:54:53,796 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2119 transitions. Word has length 28 [2018-11-10 05:54:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,796 INFO L481 AbstractCegarLoop]: Abstraction has 1289 states and 2119 transitions. [2018-11-10 05:54:53,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2119 transitions. [2018-11-10 05:54:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 05:54:53,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,798 INFO L375 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-11-10 05:54:53,799 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1848649485, now seen corresponding path program 1 times [2018-11-10 05:54:53,799 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,820 INFO L87 Difference]: Start difference. First operand 1289 states and 2119 transitions. Second operand 3 states. [2018-11-10 05:54:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,848 INFO L93 Difference]: Finished difference Result 1597 states and 2681 transitions. [2018-11-10 05:54:53,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 05:54:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,853 INFO L225 Difference]: With dead ends: 1597 [2018-11-10 05:54:53,853 INFO L226 Difference]: Without dead ends: 1595 [2018-11-10 05:54:53,854 INFO L605 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-11-10 05:54:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-10 05:54:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1289. [2018-11-10 05:54:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-10 05:54:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2103 transitions. [2018-11-10 05:54:53,889 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2103 transitions. Word has length 28 [2018-11-10 05:54:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:53,890 INFO L481 AbstractCegarLoop]: Abstraction has 1289 states and 2103 transitions. [2018-11-10 05:54:53,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2103 transitions. [2018-11-10 05:54:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 05:54:53,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:53,892 INFO L375 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-11-10 05:54:53,893 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:53,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:53,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1233273980, now seen corresponding path program 1 times [2018-11-10 05:54:53,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:53,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:53,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:53,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:53,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:53,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:53,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:53,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:53,929 INFO L87 Difference]: Start difference. First operand 1289 states and 2103 transitions. Second operand 3 states. [2018-11-10 05:54:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:53,966 INFO L93 Difference]: Finished difference Result 2365 states and 3929 transitions. [2018-11-10 05:54:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:53,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 05:54:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:53,974 INFO L225 Difference]: With dead ends: 2365 [2018-11-10 05:54:53,974 INFO L226 Difference]: Without dead ends: 2363 [2018-11-10 05:54:53,975 INFO L605 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-11-10 05:54:53,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2018-11-10 05:54:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1817. [2018-11-10 05:54:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2018-11-10 05:54:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2903 transitions. [2018-11-10 05:54:54,022 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2903 transitions. Word has length 29 [2018-11-10 05:54:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:54,022 INFO L481 AbstractCegarLoop]: Abstraction has 1817 states and 2903 transitions. [2018-11-10 05:54:54,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2903 transitions. [2018-11-10 05:54:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 05:54:54,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:54,024 INFO L375 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-11-10 05:54:54,024 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:54,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:54,024 INFO L82 PathProgramCache]: Analyzing trace with hash 212205626, now seen corresponding path program 1 times [2018-11-10 05:54:54,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:54,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:54,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:54,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:54,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:54,048 INFO L87 Difference]: Start difference. First operand 1817 states and 2903 transitions. Second operand 3 states. [2018-11-10 05:54:54,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:54,102 INFO L93 Difference]: Finished difference Result 4317 states and 6937 transitions. [2018-11-10 05:54:54,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:54,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 05:54:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:54,110 INFO L225 Difference]: With dead ends: 4317 [2018-11-10 05:54:54,110 INFO L226 Difference]: Without dead ends: 2523 [2018-11-10 05:54:54,113 INFO L605 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-11-10 05:54:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-11-10 05:54:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2521. [2018-11-10 05:54:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2018-11-10 05:54:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4007 transitions. [2018-11-10 05:54:54,183 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4007 transitions. Word has length 29 [2018-11-10 05:54:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:54,183 INFO L481 AbstractCegarLoop]: Abstraction has 2521 states and 4007 transitions. [2018-11-10 05:54:54,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4007 transitions. [2018-11-10 05:54:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 05:54:54,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:54,186 INFO L375 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-11-10 05:54:54,186 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:54,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash -422998170, now seen corresponding path program 1 times [2018-11-10 05:54:54,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:54,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:54,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:54,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:54,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:54,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:54,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:54,215 INFO L87 Difference]: Start difference. First operand 2521 states and 4007 transitions. Second operand 3 states. [2018-11-10 05:54:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:54,295 INFO L93 Difference]: Finished difference Result 3805 states and 6041 transitions. [2018-11-10 05:54:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:54,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 05:54:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:54,302 INFO L225 Difference]: With dead ends: 3805 [2018-11-10 05:54:54,303 INFO L226 Difference]: Without dead ends: 2571 [2018-11-10 05:54:54,304 INFO L605 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-11-10 05:54:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-11-10 05:54:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2569. [2018-11-10 05:54:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-11-10 05:54:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4039 transitions. [2018-11-10 05:54:54,366 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4039 transitions. Word has length 30 [2018-11-10 05:54:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:54,366 INFO L481 AbstractCegarLoop]: Abstraction has 2569 states and 4039 transitions. [2018-11-10 05:54:54,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4039 transitions. [2018-11-10 05:54:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 05:54:54,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:54,369 INFO L375 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-11-10 05:54:54,369 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:54,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2011346072, now seen corresponding path program 1 times [2018-11-10 05:54:54,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:54,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:54,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:54,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:54,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:54,392 INFO L87 Difference]: Start difference. First operand 2569 states and 4039 transitions. Second operand 3 states. [2018-11-10 05:54:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:54,450 INFO L93 Difference]: Finished difference Result 4621 states and 7401 transitions. [2018-11-10 05:54:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:54,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 05:54:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:54,463 INFO L225 Difference]: With dead ends: 4621 [2018-11-10 05:54:54,463 INFO L226 Difference]: Without dead ends: 4619 [2018-11-10 05:54:54,465 INFO L605 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-11-10 05:54:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-10 05:54:54,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 3657. [2018-11-10 05:54:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-11-10 05:54:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5607 transitions. [2018-11-10 05:54:54,545 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5607 transitions. Word has length 30 [2018-11-10 05:54:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:54,545 INFO L481 AbstractCegarLoop]: Abstraction has 3657 states and 5607 transitions. [2018-11-10 05:54:54,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5607 transitions. [2018-11-10 05:54:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 05:54:54,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:54,549 INFO L375 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-11-10 05:54:54,549 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:54,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1262552870, now seen corresponding path program 1 times [2018-11-10 05:54:54,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:54,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:54,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:54,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:54,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:54,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:54,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:54,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:54,565 INFO L87 Difference]: Start difference. First operand 3657 states and 5607 transitions. Second operand 3 states. [2018-11-10 05:54:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:54,641 INFO L93 Difference]: Finished difference Result 8589 states and 13225 transitions. [2018-11-10 05:54:54,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:54,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 05:54:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:54,654 INFO L225 Difference]: With dead ends: 8589 [2018-11-10 05:54:54,654 INFO L226 Difference]: Without dead ends: 5003 [2018-11-10 05:54:54,659 INFO L605 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-11-10 05:54:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-10 05:54:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 5001. [2018-11-10 05:54:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5001 states. [2018-11-10 05:54:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 7623 transitions. [2018-11-10 05:54:54,773 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 7623 transitions. Word has length 30 [2018-11-10 05:54:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:54,773 INFO L481 AbstractCegarLoop]: Abstraction has 5001 states and 7623 transitions. [2018-11-10 05:54:54,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 7623 transitions. [2018-11-10 05:54:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 05:54:54,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:54,777 INFO L375 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-11-10 05:54:54,778 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:54,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash 2072995663, now seen corresponding path program 1 times [2018-11-10 05:54:54,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:54,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:54,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:54,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:54,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:54,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:54,797 INFO L87 Difference]: Start difference. First operand 5001 states and 7623 transitions. Second operand 3 states. [2018-11-10 05:54:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:54,877 INFO L93 Difference]: Finished difference Result 7501 states and 11401 transitions. [2018-11-10 05:54:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:54,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 05:54:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:54,886 INFO L225 Difference]: With dead ends: 7501 [2018-11-10 05:54:54,886 INFO L226 Difference]: Without dead ends: 5067 [2018-11-10 05:54:54,890 INFO L605 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-11-10 05:54:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-11-10 05:54:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5065. [2018-11-10 05:54:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5065 states. [2018-11-10 05:54:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7623 transitions. [2018-11-10 05:54:54,995 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7623 transitions. Word has length 31 [2018-11-10 05:54:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:54,995 INFO L481 AbstractCegarLoop]: Abstraction has 5065 states and 7623 transitions. [2018-11-10 05:54:54,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7623 transitions. [2018-11-10 05:54:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 05:54:54,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:54,999 INFO L375 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-11-10 05:54:54,999 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:54,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash 484647761, now seen corresponding path program 1 times [2018-11-10 05:54:55,000 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:55,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:55,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:55,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:55,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:55,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:55,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:55,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:55,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:55,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:55,017 INFO L87 Difference]: Start difference. First operand 5065 states and 7623 transitions. Second operand 3 states. [2018-11-10 05:54:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:55,136 INFO L93 Difference]: Finished difference Result 8973 states and 13769 transitions. [2018-11-10 05:54:55,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:55,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 05:54:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:55,151 INFO L225 Difference]: With dead ends: 8973 [2018-11-10 05:54:55,151 INFO L226 Difference]: Without dead ends: 8971 [2018-11-10 05:54:55,154 INFO L605 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-11-10 05:54:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-11-10 05:54:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 7305. [2018-11-10 05:54:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2018-11-10 05:54:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 10695 transitions. [2018-11-10 05:54:55,325 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 10695 transitions. Word has length 31 [2018-11-10 05:54:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:55,325 INFO L481 AbstractCegarLoop]: Abstraction has 7305 states and 10695 transitions. [2018-11-10 05:54:55,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 10695 transitions. [2018-11-10 05:54:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 05:54:55,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:55,334 INFO L375 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-11-10 05:54:55,334 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:55,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:55,335 INFO L82 PathProgramCache]: Analyzing trace with hash -536420593, now seen corresponding path program 1 times [2018-11-10 05:54:55,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:55,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:55,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:55,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:55,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:55,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:55,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:55,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:55,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:55,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:55,361 INFO L87 Difference]: Start difference. First operand 7305 states and 10695 transitions. Second operand 3 states. [2018-11-10 05:54:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:55,533 INFO L93 Difference]: Finished difference Result 17037 states and 25033 transitions. [2018-11-10 05:54:55,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:55,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 05:54:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:55,543 INFO L225 Difference]: With dead ends: 17037 [2018-11-10 05:54:55,543 INFO L226 Difference]: Without dead ends: 9867 [2018-11-10 05:54:55,549 INFO L605 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-11-10 05:54:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2018-11-10 05:54:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9865. [2018-11-10 05:54:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9865 states. [2018-11-10 05:54:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 14343 transitions. [2018-11-10 05:54:55,680 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 14343 transitions. Word has length 31 [2018-11-10 05:54:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:55,680 INFO L481 AbstractCegarLoop]: Abstraction has 9865 states and 14343 transitions. [2018-11-10 05:54:55,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 14343 transitions. [2018-11-10 05:54:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 05:54:55,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:55,686 INFO L375 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-11-10 05:54:55,686 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:55,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2139393499, now seen corresponding path program 1 times [2018-11-10 05:54:55,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:55,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:55,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:55,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:55,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:55,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:55,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:55,708 INFO L87 Difference]: Start difference. First operand 9865 states and 14343 transitions. Second operand 3 states. [2018-11-10 05:54:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:55,796 INFO L93 Difference]: Finished difference Result 14797 states and 21449 transitions. [2018-11-10 05:54:55,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:55,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 05:54:55,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:55,806 INFO L225 Difference]: With dead ends: 14797 [2018-11-10 05:54:55,807 INFO L226 Difference]: Without dead ends: 9995 [2018-11-10 05:54:55,812 INFO L605 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-11-10 05:54:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2018-11-10 05:54:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9993. [2018-11-10 05:54:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9993 states. [2018-11-10 05:54:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9993 states to 9993 states and 14343 transitions. [2018-11-10 05:54:55,940 INFO L78 Accepts]: Start accepts. Automaton has 9993 states and 14343 transitions. Word has length 32 [2018-11-10 05:54:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:55,940 INFO L481 AbstractCegarLoop]: Abstraction has 9993 states and 14343 transitions. [2018-11-10 05:54:55,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9993 states and 14343 transitions. [2018-11-10 05:54:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 05:54:55,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:55,945 INFO L375 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-11-10 05:54:55,945 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:55,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:55,945 INFO L82 PathProgramCache]: Analyzing trace with hash 551045597, now seen corresponding path program 1 times [2018-11-10 05:54:55,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:55,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:55,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:55,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:55,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:55,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:55,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:55,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:55,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:55,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:55,972 INFO L87 Difference]: Start difference. First operand 9993 states and 14343 transitions. Second operand 3 states. [2018-11-10 05:54:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:56,096 INFO L93 Difference]: Finished difference Result 17421 states and 25481 transitions. [2018-11-10 05:54:56,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:56,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 05:54:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:56,114 INFO L225 Difference]: With dead ends: 17421 [2018-11-10 05:54:56,114 INFO L226 Difference]: Without dead ends: 17419 [2018-11-10 05:54:56,119 INFO L605 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-11-10 05:54:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2018-11-10 05:54:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 14601. [2018-11-10 05:54:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14601 states. [2018-11-10 05:54:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20359 transitions. [2018-11-10 05:54:56,354 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20359 transitions. Word has length 32 [2018-11-10 05:54:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:56,354 INFO L481 AbstractCegarLoop]: Abstraction has 14601 states and 20359 transitions. [2018-11-10 05:54:56,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20359 transitions. [2018-11-10 05:54:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 05:54:56,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:56,364 INFO L375 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-11-10 05:54:56,364 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:56,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:56,364 INFO L82 PathProgramCache]: Analyzing trace with hash -470022757, now seen corresponding path program 1 times [2018-11-10 05:54:56,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:56,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:56,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:56,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:56,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:56,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:56,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:56,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:56,384 INFO L87 Difference]: Start difference. First operand 14601 states and 20359 transitions. Second operand 3 states. [2018-11-10 05:54:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:56,555 INFO L93 Difference]: Finished difference Result 33805 states and 47241 transitions. [2018-11-10 05:54:56,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:56,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 05:54:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:56,575 INFO L225 Difference]: With dead ends: 33805 [2018-11-10 05:54:56,575 INFO L226 Difference]: Without dead ends: 19467 [2018-11-10 05:54:56,589 INFO L605 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-11-10 05:54:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19467 states. [2018-11-10 05:54:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19467 to 19465. [2018-11-10 05:54:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19465 states. [2018-11-10 05:54:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19465 states to 19465 states and 26887 transitions. [2018-11-10 05:54:56,829 INFO L78 Accepts]: Start accepts. Automaton has 19465 states and 26887 transitions. Word has length 32 [2018-11-10 05:54:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:56,830 INFO L481 AbstractCegarLoop]: Abstraction has 19465 states and 26887 transitions. [2018-11-10 05:54:56,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19465 states and 26887 transitions. [2018-11-10 05:54:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 05:54:56,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:56,839 INFO L375 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-11-10 05:54:56,840 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:56,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash -97240540, now seen corresponding path program 1 times [2018-11-10 05:54:56,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:56,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:56,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:56,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:56,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:56,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:56,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:56,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:56,860 INFO L87 Difference]: Start difference. First operand 19465 states and 26887 transitions. Second operand 3 states. [2018-11-10 05:54:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:57,045 INFO L93 Difference]: Finished difference Result 29197 states and 40201 transitions. [2018-11-10 05:54:57,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:57,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 05:54:57,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:57,074 INFO L225 Difference]: With dead ends: 29197 [2018-11-10 05:54:57,074 INFO L226 Difference]: Without dead ends: 19723 [2018-11-10 05:54:57,085 INFO L605 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-11-10 05:54:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19723 states. [2018-11-10 05:54:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19723 to 19721. [2018-11-10 05:54:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19721 states. [2018-11-10 05:54:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19721 states to 19721 states and 26887 transitions. [2018-11-10 05:54:57,432 INFO L78 Accepts]: Start accepts. Automaton has 19721 states and 26887 transitions. Word has length 33 [2018-11-10 05:54:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:57,433 INFO L481 AbstractCegarLoop]: Abstraction has 19721 states and 26887 transitions. [2018-11-10 05:54:57,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 19721 states and 26887 transitions. [2018-11-10 05:54:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 05:54:57,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:57,443 INFO L375 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-11-10 05:54:57,443 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:57,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1685588442, now seen corresponding path program 1 times [2018-11-10 05:54:57,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:57,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:57,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:57,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:57,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:57,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:57,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:57,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:57,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:57,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:57,460 INFO L87 Difference]: Start difference. First operand 19721 states and 26887 transitions. Second operand 3 states. [2018-11-10 05:54:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:57,708 INFO L93 Difference]: Finished difference Result 33805 states and 46857 transitions. [2018-11-10 05:54:57,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:57,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 05:54:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:57,750 INFO L225 Difference]: With dead ends: 33805 [2018-11-10 05:54:57,750 INFO L226 Difference]: Without dead ends: 33803 [2018-11-10 05:54:57,758 INFO L605 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-11-10 05:54:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33803 states. [2018-11-10 05:54:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33803 to 29193. [2018-11-10 05:54:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29193 states. [2018-11-10 05:54:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29193 states to 29193 states and 38663 transitions. [2018-11-10 05:54:58,221 INFO L78 Accepts]: Start accepts. Automaton has 29193 states and 38663 transitions. Word has length 33 [2018-11-10 05:54:58,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:58,221 INFO L481 AbstractCegarLoop]: Abstraction has 29193 states and 38663 transitions. [2018-11-10 05:54:58,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 29193 states and 38663 transitions. [2018-11-10 05:54:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 05:54:58,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:58,234 INFO L375 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-11-10 05:54:58,234 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:58,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:58,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1588310500, now seen corresponding path program 1 times [2018-11-10 05:54:58,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:58,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:58,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:58,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:58,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:58,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:58,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:58,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:58,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:58,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:58,272 INFO L87 Difference]: Start difference. First operand 29193 states and 38663 transitions. Second operand 3 states. [2018-11-10 05:54:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:58,554 INFO L93 Difference]: Finished difference Result 67085 states and 88841 transitions. [2018-11-10 05:54:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:58,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 05:54:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:58,601 INFO L225 Difference]: With dead ends: 67085 [2018-11-10 05:54:58,601 INFO L226 Difference]: Without dead ends: 38411 [2018-11-10 05:54:58,630 INFO L605 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-11-10 05:54:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38411 states. [2018-11-10 05:54:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38411 to 38409. [2018-11-10 05:54:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38409 states. [2018-11-10 05:54:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38409 states to 38409 states and 50183 transitions. [2018-11-10 05:54:59,243 INFO L78 Accepts]: Start accepts. Automaton has 38409 states and 50183 transitions. Word has length 33 [2018-11-10 05:54:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:54:59,243 INFO L481 AbstractCegarLoop]: Abstraction has 38409 states and 50183 transitions. [2018-11-10 05:54:59,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:54:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 38409 states and 50183 transitions. [2018-11-10 05:54:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 05:54:59,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:54:59,255 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:54:59,255 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:54:59,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:54:59,255 INFO L82 PathProgramCache]: Analyzing trace with hash -713418672, now seen corresponding path program 1 times [2018-11-10 05:54:59,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:54:59,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:54:59,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:59,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:54:59,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:54:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:54:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:54:59,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:54:59,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:54:59,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:54:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:54:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:54:59,281 INFO L87 Difference]: Start difference. First operand 38409 states and 50183 transitions. Second operand 3 states. [2018-11-10 05:54:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:54:59,610 INFO L93 Difference]: Finished difference Result 57613 states and 75017 transitions. [2018-11-10 05:54:59,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:54:59,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 05:54:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:54:59,636 INFO L225 Difference]: With dead ends: 57613 [2018-11-10 05:54:59,636 INFO L226 Difference]: Without dead ends: 38923 [2018-11-10 05:54:59,648 INFO L605 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-11-10 05:54:59,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38923 states. [2018-11-10 05:55:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38923 to 38921. [2018-11-10 05:55:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38921 states. [2018-11-10 05:55:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38921 states to 38921 states and 50183 transitions. [2018-11-10 05:55:00,089 INFO L78 Accepts]: Start accepts. Automaton has 38921 states and 50183 transitions. Word has length 34 [2018-11-10 05:55:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:55:00,089 INFO L481 AbstractCegarLoop]: Abstraction has 38921 states and 50183 transitions. [2018-11-10 05:55:00,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:55:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 38921 states and 50183 transitions. [2018-11-10 05:55:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 05:55:00,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:55:00,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:00,100 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:55:00,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1993200722, now seen corresponding path program 1 times [2018-11-10 05:55:00,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:00,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:00,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:55:00,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:00,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:00,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:55:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:00,114 INFO L87 Difference]: Start difference. First operand 38921 states and 50183 transitions. Second operand 3 states. [2018-11-10 05:55:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:00,838 INFO L93 Difference]: Finished difference Result 65549 states and 85513 transitions. [2018-11-10 05:55:00,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:55:00,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 05:55:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:55:00,874 INFO L225 Difference]: With dead ends: 65549 [2018-11-10 05:55:00,874 INFO L226 Difference]: Without dead ends: 65547 [2018-11-10 05:55:00,881 INFO L605 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-11-10 05:55:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65547 states. [2018-11-10 05:55:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65547 to 58377. [2018-11-10 05:55:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58377 states. [2018-11-10 05:55:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58377 states to 58377 states and 73223 transitions. [2018-11-10 05:55:01,474 INFO L78 Accepts]: Start accepts. Automaton has 58377 states and 73223 transitions. Word has length 34 [2018-11-10 05:55:01,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:55:01,474 INFO L481 AbstractCegarLoop]: Abstraction has 58377 states and 73223 transitions. [2018-11-10 05:55:01,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:55:01,474 INFO L276 IsEmpty]: Start isEmpty. Operand 58377 states and 73223 transitions. [2018-11-10 05:55:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 05:55:01,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:55:01,496 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:01,496 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:55:01,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 972132368, now seen corresponding path program 1 times [2018-11-10 05:55:01,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:01,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:01,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:55:01,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:01,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:01,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:55:01,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:01,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:01,532 INFO L87 Difference]: Start difference. First operand 58377 states and 73223 transitions. Second operand 3 states. [2018-11-10 05:55:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:02,362 INFO L93 Difference]: Finished difference Result 133133 states and 166409 transitions. [2018-11-10 05:55:02,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:55:02,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 05:55:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:55:02,411 INFO L225 Difference]: With dead ends: 133133 [2018-11-10 05:55:02,411 INFO L226 Difference]: Without dead ends: 75787 [2018-11-10 05:55:02,441 INFO L605 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-11-10 05:55:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states. [2018-11-10 05:55:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75787 to 75785. [2018-11-10 05:55:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75785 states. [2018-11-10 05:55:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75785 states to 75785 states and 93191 transitions. [2018-11-10 05:55:03,370 INFO L78 Accepts]: Start accepts. Automaton has 75785 states and 93191 transitions. Word has length 34 [2018-11-10 05:55:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:55:03,370 INFO L481 AbstractCegarLoop]: Abstraction has 75785 states and 93191 transitions. [2018-11-10 05:55:03,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:55:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 75785 states and 93191 transitions. [2018-11-10 05:55:03,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 05:55:03,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:55:03,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:03,399 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:55:03,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1659896057, now seen corresponding path program 1 times [2018-11-10 05:55:03,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:03,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:03,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:55:03,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:03,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:03,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:55:03,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:03,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:03,418 INFO L87 Difference]: Start difference. First operand 75785 states and 93191 transitions. Second operand 3 states. [2018-11-10 05:55:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:04,312 INFO L93 Difference]: Finished difference Result 113677 states and 139273 transitions. [2018-11-10 05:55:04,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:55:04,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 05:55:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:55:04,369 INFO L225 Difference]: With dead ends: 113677 [2018-11-10 05:55:04,370 INFO L226 Difference]: Without dead ends: 76811 [2018-11-10 05:55:04,399 INFO L605 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-11-10 05:55:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76811 states. [2018-11-10 05:55:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76811 to 76809. [2018-11-10 05:55:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76809 states. [2018-11-10 05:55:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76809 states to 76809 states and 93191 transitions. [2018-11-10 05:55:05,364 INFO L78 Accepts]: Start accepts. Automaton has 76809 states and 93191 transitions. Word has length 35 [2018-11-10 05:55:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:55:05,364 INFO L481 AbstractCegarLoop]: Abstraction has 76809 states and 93191 transitions. [2018-11-10 05:55:05,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:55:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 76809 states and 93191 transitions. [2018-11-10 05:55:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 05:55:05,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:55:05,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:05,388 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:55:05,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:05,389 INFO L82 PathProgramCache]: Analyzing trace with hash 71548155, now seen corresponding path program 1 times [2018-11-10 05:55:05,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:05,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:05,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:05,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:05,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:55:05,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:05,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:05,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:55:05,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:05,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:05,413 INFO L87 Difference]: Start difference. First operand 76809 states and 93191 transitions. Second operand 3 states. [2018-11-10 05:55:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:06,549 INFO L93 Difference]: Finished difference Result 126989 states and 154633 transitions. [2018-11-10 05:55:06,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:55:06,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 05:55:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:55:06,644 INFO L225 Difference]: With dead ends: 126989 [2018-11-10 05:55:06,644 INFO L226 Difference]: Without dead ends: 126987 [2018-11-10 05:55:06,663 INFO L605 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-11-10 05:55:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126987 states. [2018-11-10 05:55:07,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126987 to 116745. [2018-11-10 05:55:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116745 states. [2018-11-10 05:55:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116745 states to 116745 states and 138247 transitions. [2018-11-10 05:55:08,223 INFO L78 Accepts]: Start accepts. Automaton has 116745 states and 138247 transitions. Word has length 35 [2018-11-10 05:55:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:55:08,223 INFO L481 AbstractCegarLoop]: Abstraction has 116745 states and 138247 transitions. [2018-11-10 05:55:08,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:55:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 116745 states and 138247 transitions. [2018-11-10 05:55:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 05:55:08,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:55:08,275 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:08,275 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:55:08,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash -949520199, now seen corresponding path program 1 times [2018-11-10 05:55:08,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:08,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:08,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:08,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:55:08,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:08,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:08,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:55:08,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:08,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:08,294 INFO L87 Difference]: Start difference. First operand 116745 states and 138247 transitions. Second operand 3 states. [2018-11-10 05:55:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:09,619 INFO L93 Difference]: Finished difference Result 264205 states and 310281 transitions. [2018-11-10 05:55:09,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:55:09,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-10 05:55:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:55:09,738 INFO L225 Difference]: With dead ends: 264205 [2018-11-10 05:55:09,738 INFO L226 Difference]: Without dead ends: 149515 [2018-11-10 05:55:09,806 INFO L605 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-11-10 05:55:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149515 states. [2018-11-10 05:55:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149515 to 149513. [2018-11-10 05:55:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149513 states. [2018-11-10 05:55:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149513 states to 149513 states and 172039 transitions. [2018-11-10 05:55:13,370 INFO L78 Accepts]: Start accepts. Automaton has 149513 states and 172039 transitions. Word has length 35 [2018-11-10 05:55:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:55:13,370 INFO L481 AbstractCegarLoop]: Abstraction has 149513 states and 172039 transitions. [2018-11-10 05:55:13,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:55:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 149513 states and 172039 transitions. [2018-11-10 05:55:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 05:55:13,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:55:13,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:13,424 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:55:13,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash -2076758331, now seen corresponding path program 1 times [2018-11-10 05:55:13,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:13,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:13,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:55:13,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:13,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:13,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:55:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:13,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:13,453 INFO L87 Difference]: Start difference. First operand 149513 states and 172039 transitions. Second operand 3 states. [2018-11-10 05:55:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:14,724 INFO L93 Difference]: Finished difference Result 224269 states and 257033 transitions. [2018-11-10 05:55:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:55:14,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 05:55:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:55:14,855 INFO L225 Difference]: With dead ends: 224269 [2018-11-10 05:55:14,855 INFO L226 Difference]: Without dead ends: 151563 [2018-11-10 05:55:14,916 INFO L605 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-11-10 05:55:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151563 states. [2018-11-10 05:55:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151563 to 151561. [2018-11-10 05:55:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-11-10 05:55:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 172039 transitions. [2018-11-10 05:55:17,271 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 172039 transitions. Word has length 36 [2018-11-10 05:55:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:55:17,271 INFO L481 AbstractCegarLoop]: Abstraction has 151561 states and 172039 transitions. [2018-11-10 05:55:17,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:55:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 172039 transitions. [2018-11-10 05:55:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 05:55:17,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:55:17,325 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:17,325 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:55:17,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash 629861063, now seen corresponding path program 1 times [2018-11-10 05:55:17,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:17,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:17,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:17,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:55:17,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:17,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:17,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:55:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:17,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:17,357 INFO L87 Difference]: Start difference. First operand 151561 states and 172039 transitions. Second operand 3 states. [2018-11-10 05:55:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:20,109 INFO L93 Difference]: Finished difference Result 442379 states and 491528 transitions. [2018-11-10 05:55:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:55:20,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 05:55:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:55:20,237 INFO L225 Difference]: With dead ends: 442379 [2018-11-10 05:55:20,238 INFO L226 Difference]: Without dead ends: 151561 [2018-11-10 05:55:20,348 INFO L605 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-11-10 05:55:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151561 states. [2018-11-10 05:55:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151561 to 151561. [2018-11-10 05:55:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151561 states. [2018-11-10 05:55:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151561 states to 151561 states and 163847 transitions. [2018-11-10 05:55:22,343 INFO L78 Accepts]: Start accepts. Automaton has 151561 states and 163847 transitions. Word has length 36 [2018-11-10 05:55:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:55:22,343 INFO L481 AbstractCegarLoop]: Abstraction has 151561 states and 163847 transitions. [2018-11-10 05:55:22,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:55:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 151561 states and 163847 transitions. [2018-11-10 05:55:22,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 05:55:22,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:55:22,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:55:22,395 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:55:22,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:55:22,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1650929417, now seen corresponding path program 1 times [2018-11-10 05:55:22,395 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:55:22,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:55:22,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:22,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:55:22,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:55:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:55:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:55:22,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:55:22,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:55:22,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:55:22,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:55:22,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:55:22,411 INFO L87 Difference]: Start difference. First operand 151561 states and 163847 transitions. Second operand 3 states. [2018-11-10 05:55:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:55:23,757 INFO L93 Difference]: Finished difference Result 151561 states and 163847 transitions. [2018-11-10 05:55:23,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:55:23,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-10 05:55:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:55:23,758 INFO L225 Difference]: With dead ends: 151561 [2018-11-10 05:55:23,758 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 05:55:23,805 INFO L605 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-11-10 05:55:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 05:55:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 05:55:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 05:55:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:55:23,806 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-10 05:55:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:55:23,806 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:55:23,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:55:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:55:23,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 05:55:23,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 05:55:23,853 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 05:55:23,853 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:55:23,853 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:55:23,853 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 05:55:23,853 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:55:23,853 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L428 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-10 05:55:23,854 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,855 INFO L425 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-11-10 05:55:23,856 INFO L425 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,856 INFO L428 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-11-10 05:55:23,856 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,856 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-11-10 05:55:23,856 INFO L425 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-11-10 05:55:23,856 INFO L425 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,856 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 05:55:23,856 INFO L421 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-11-10 05:55:23,856 INFO L425 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,856 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-11-10 05:55:23,856 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,857 INFO L425 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-11-10 05:55:23,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:55:23 BoogieIcfgContainer [2018-11-10 05:55:23,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:55:23,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:55:23,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:55:23,865 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:55:23,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:54:52" (3/4) ... [2018-11-10 05:55:23,869 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 05:55:23,879 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 05:55:23,879 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 05:55:23,885 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 05:55:23,885 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 05:55:23,885 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 05:55:23,930 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1ababbfd-22de-4302-aa16-bea2c7afc8e6/bin-2019/uautomizer/witness.graphml [2018-11-10 05:55:23,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:55:23,931 INFO L168 Benchmark]: Toolchain (without parser) took 31794.07 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.2 GB). Free memory was 959.1 MB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 951.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:23,932 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:55:23,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:23,932 INFO L168 Benchmark]: Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.0 GB. Free memory was 947.1 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:23,932 INFO L168 Benchmark]: RCFGBuilder took 278.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:23,933 INFO L168 Benchmark]: TraceAbstraction took 31270.86 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 963.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:23,933 INFO L168 Benchmark]: Witness Printer took 65.21 ms. Allocated memory is still 5.2 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:55:23,934 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.0 GB. Free memory was 947.1 MB in the beginning and 944.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 278.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31270.86 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 963.5 MB. Max. memory is 11.5 GB. * Witness Printer took 65.21 ms. Allocated memory is still 5.2 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. SAFE Result, 31.2s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4036 SDtfs, 2016 SDslu, 2748 SDs, 0 SdLazy, 195 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151561occurred in iteration=35, 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: 15.4s AutomataMinimizationTime, 37 MinimizatonAttempts, 28711 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 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.7s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1080 ConstructedInterpolants, 0 QuantifiedInterpolants, 65104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...