./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:46:09,358 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:46:09,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:46:09,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:46:09,365 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:46:09,366 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:46:09,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:46:09,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:46:09,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:46:09,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:46:09,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:46:09,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:46:09,371 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:46:09,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:46:09,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:46:09,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:46:09,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:46:09,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:46:09,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:46:09,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:46:09,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:46:09,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:46:09,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:46:09,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:46:09,381 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:46:09,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:46:09,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:46:09,382 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:46:09,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:46:09,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:46:09,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:46:09,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:46:09,384 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:46:09,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:46:09,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:46:09,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:46:09,386 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 13:46:09,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:46:09,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:46:09,394 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:46:09,395 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 13:46:09,395 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:46:09,395 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:46:09,395 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:46:09,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:46:09,396 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:46:09,396 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:46:09,396 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:46:09,396 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:46:09,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:46:09,396 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:46:09,396 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:46:09,397 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:46:09,397 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:46:09,397 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:46:09,397 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:46:09,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:46:09,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:46:09,397 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:46:09,398 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:46:09,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:46:09,398 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:46:09,398 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:46:09,398 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:46:09,398 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:46:09,398 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:46:09,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:46:09,399 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_1cc5bd57-3fd9-4d55-9187-92a24e90f835/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-11-18 13:46:09,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:46:09,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:46:09,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:46:09,432 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:46:09,432 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:46:09,433 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 13:46:09,475 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/data/2e842fdb0/5a77db9b1cac4d459b61a06aa990f2fb/FLAGd61b85b6f [2018-11-18 13:46:09,872 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:46:09,872 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 13:46:09,877 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/data/2e842fdb0/5a77db9b1cac4d459b61a06aa990f2fb/FLAGd61b85b6f [2018-11-18 13:46:09,885 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/data/2e842fdb0/5a77db9b1cac4d459b61a06aa990f2fb [2018-11-18 13:46:09,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:46:09,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 13:46:09,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:46:09,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:46:09,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:46:09,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:46:09" (1/1) ... [2018-11-18 13:46:09,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ec56fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:09, skipping insertion in model container [2018-11-18 13:46:09,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:46:09" (1/1) ... [2018-11-18 13:46:09,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:46:09,917 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:46:10,029 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:46:10,031 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:46:10,050 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:46:10,058 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:46:10,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10 WrapperNode [2018-11-18 13:46:10,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:46:10,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:46:10,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:46:10,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:46:10,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10" (1/1) ... [2018-11-18 13:46:10,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10" (1/1) ... [2018-11-18 13:46:10,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10" (1/1) ... [2018-11-18 13:46:10,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10" (1/1) ... [2018-11-18 13:46:10,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10" (1/1) ... [2018-11-18 13:46:10,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10" (1/1) ... [2018-11-18 13:46:10,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10" (1/1) ... [2018-11-18 13:46:10,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:46:10,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:46:10,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:46:10,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:46:10,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/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-18 13:46:10,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:46:10,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:46:10,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:46:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 13:46:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 13:46:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:46:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:46:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:46:10,434 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:46:10,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:10 BoogieIcfgContainer [2018-11-18 13:46:10,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:46:10,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:46:10,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:46:10,438 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:46:10,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:46:09" (1/3) ... [2018-11-18 13:46:10,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469f6cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:46:10, skipping insertion in model container [2018-11-18 13:46:10,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:46:10" (2/3) ... [2018-11-18 13:46:10,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469f6cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:46:10, skipping insertion in model container [2018-11-18 13:46:10,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:10" (3/3) ... [2018-11-18 13:46:10,440 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 13:46:10,447 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:46:10,454 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:46:10,465 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:46:10,488 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:46:10,489 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:46:10,489 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:46:10,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:46:10,489 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:46:10,489 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:46:10,489 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:46:10,490 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:46:10,490 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:46:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-18 13:46:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 13:46:10,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:10,511 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-18 13:46:10,513 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:10,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash -26794943, now seen corresponding path program 1 times [2018-11-18 13:46:10,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:10,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:10,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:10,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:10,649 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-18 13:46:10,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:10,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:10,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:10,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:10,666 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-11-18 13:46:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:10,724 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2018-11-18 13:46:10,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:10,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 13:46:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:10,732 INFO L225 Difference]: With dead ends: 119 [2018-11-18 13:46:10,733 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 13:46:10,735 INFO L604 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-18 13:46:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 13:46:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2018-11-18 13:46:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 13:46:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2018-11-18 13:46:10,760 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2018-11-18 13:46:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:10,760 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2018-11-18 13:46:10,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2018-11-18 13:46:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 13:46:10,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:10,761 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-18 13:46:10,762 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:10,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:10,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2020939649, now seen corresponding path program 1 times [2018-11-18 13:46:10,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:10,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:10,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:10,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-18 13:46:10,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:10,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:10,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:10,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:10,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:10,821 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand 3 states. [2018-11-18 13:46:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:10,840 INFO L93 Difference]: Finished difference Result 170 states and 315 transitions. [2018-11-18 13:46:10,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:10,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 13:46:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:10,842 INFO L225 Difference]: With dead ends: 170 [2018-11-18 13:46:10,842 INFO L226 Difference]: Without dead ends: 104 [2018-11-18 13:46:10,843 INFO L604 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-18 13:46:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-18 13:46:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-11-18 13:46:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-18 13:46:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 187 transitions. [2018-11-18 13:46:10,848 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 187 transitions. Word has length 26 [2018-11-18 13:46:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:10,848 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 187 transitions. [2018-11-18 13:46:10,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 187 transitions. [2018-11-18 13:46:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 13:46:10,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:10,849 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-18 13:46:10,849 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:10,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash -830431472, now seen corresponding path program 1 times [2018-11-18 13:46:10,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:10,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:10,890 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-18 13:46:10,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:10,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:10,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:10,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:10,891 INFO L87 Difference]: Start difference. First operand 102 states and 187 transitions. Second operand 3 states. [2018-11-18 13:46:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:10,903 INFO L93 Difference]: Finished difference Result 157 states and 283 transitions. [2018-11-18 13:46:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:10,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 13:46:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:10,904 INFO L225 Difference]: With dead ends: 157 [2018-11-18 13:46:10,904 INFO L226 Difference]: Without dead ends: 108 [2018-11-18 13:46:10,905 INFO L604 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-18 13:46:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-18 13:46:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-11-18 13:46:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 13:46:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 190 transitions. [2018-11-18 13:46:10,911 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 190 transitions. Word has length 27 [2018-11-18 13:46:10,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:10,911 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 190 transitions. [2018-11-18 13:46:10,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 190 transitions. [2018-11-18 13:46:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 13:46:10,912 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:10,912 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-18 13:46:10,912 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:10,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:10,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1775592082, now seen corresponding path program 1 times [2018-11-18 13:46:10,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:10,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:10,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:10,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:10,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:10,947 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-18 13:46:10,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:10,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:10,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:10,949 INFO L87 Difference]: Start difference. First operand 106 states and 190 transitions. Second operand 3 states. [2018-11-18 13:46:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:10,985 INFO L93 Difference]: Finished difference Result 201 states and 365 transitions. [2018-11-18 13:46:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:10,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 13:46:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:10,986 INFO L225 Difference]: With dead ends: 201 [2018-11-18 13:46:10,986 INFO L226 Difference]: Without dead ends: 199 [2018-11-18 13:46:10,987 INFO L604 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-18 13:46:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-18 13:46:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 139. [2018-11-18 13:46:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 13:46:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 251 transitions. [2018-11-18 13:46:10,995 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 251 transitions. Word has length 27 [2018-11-18 13:46:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:10,995 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 251 transitions. [2018-11-18 13:46:10,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 251 transitions. [2018-11-18 13:46:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 13:46:10,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:10,996 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-18 13:46:10,996 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:10,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:10,997 INFO L82 PathProgramCache]: Analyzing trace with hash -218552624, now seen corresponding path program 1 times [2018-11-18 13:46:10,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:10,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:10,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:10,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:10,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,019 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-18 13:46:11,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,020 INFO L87 Difference]: Start difference. First operand 139 states and 251 transitions. Second operand 3 states. [2018-11-18 13:46:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,038 INFO L93 Difference]: Finished difference Result 331 states and 605 transitions. [2018-11-18 13:46:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 13:46:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,039 INFO L225 Difference]: With dead ends: 331 [2018-11-18 13:46:11,039 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 13:46:11,040 INFO L604 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-18 13:46:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 13:46:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-11-18 13:46:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-18 13:46:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 359 transitions. [2018-11-18 13:46:11,049 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 359 transitions. Word has length 27 [2018-11-18 13:46:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,050 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 359 transitions. [2018-11-18 13:46:11,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 359 transitions. [2018-11-18 13:46:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 13:46:11,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,051 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-18 13:46:11,051 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash -791008204, now seen corresponding path program 1 times [2018-11-18 13:46:11,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,086 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-18 13:46:11,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,087 INFO L87 Difference]: Start difference. First operand 199 states and 359 transitions. Second operand 3 states. [2018-11-18 13:46:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,109 INFO L93 Difference]: Finished difference Result 298 states and 536 transitions. [2018-11-18 13:46:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 13:46:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,111 INFO L225 Difference]: With dead ends: 298 [2018-11-18 13:46:11,111 INFO L226 Difference]: Without dead ends: 203 [2018-11-18 13:46:11,112 INFO L604 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-18 13:46:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-18 13:46:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-18 13:46:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 13:46:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 359 transitions. [2018-11-18 13:46:11,120 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 359 transitions. Word has length 28 [2018-11-18 13:46:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,120 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 359 transitions. [2018-11-18 13:46:11,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 359 transitions. [2018-11-18 13:46:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 13:46:11,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,121 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-18 13:46:11,121 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1815015350, now seen corresponding path program 1 times [2018-11-18 13:46:11,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,150 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-18 13:46:11,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,152 INFO L87 Difference]: Start difference. First operand 201 states and 359 transitions. Second operand 3 states. [2018-11-18 13:46:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,185 INFO L93 Difference]: Finished difference Result 381 states and 689 transitions. [2018-11-18 13:46:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 13:46:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,187 INFO L225 Difference]: With dead ends: 381 [2018-11-18 13:46:11,187 INFO L226 Difference]: Without dead ends: 379 [2018-11-18 13:46:11,188 INFO L604 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-18 13:46:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-18 13:46:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 269. [2018-11-18 13:46:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-18 13:46:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 479 transitions. [2018-11-18 13:46:11,197 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 479 transitions. Word has length 28 [2018-11-18 13:46:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,197 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 479 transitions. [2018-11-18 13:46:11,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 479 transitions. [2018-11-18 13:46:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 13:46:11,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,198 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-18 13:46:11,198 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,199 INFO L82 PathProgramCache]: Analyzing trace with hash -179129356, now seen corresponding path program 1 times [2018-11-18 13:46:11,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,230 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-18 13:46:11,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,231 INFO L87 Difference]: Start difference. First operand 269 states and 479 transitions. Second operand 3 states. [2018-11-18 13:46:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,258 INFO L93 Difference]: Finished difference Result 645 states and 1157 transitions. [2018-11-18 13:46:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 13:46:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,260 INFO L225 Difference]: With dead ends: 645 [2018-11-18 13:46:11,260 INFO L226 Difference]: Without dead ends: 387 [2018-11-18 13:46:11,261 INFO L604 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-18 13:46:11,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-18 13:46:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2018-11-18 13:46:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-18 13:46:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 683 transitions. [2018-11-18 13:46:11,272 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 683 transitions. Word has length 28 [2018-11-18 13:46:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,272 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 683 transitions. [2018-11-18 13:46:11,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 683 transitions. [2018-11-18 13:46:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 13:46:11,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,273 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-18 13:46:11,273 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash 431113445, now seen corresponding path program 1 times [2018-11-18 13:46:11,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,302 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-18 13:46:11,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,303 INFO L87 Difference]: Start difference. First operand 385 states and 683 transitions. Second operand 3 states. [2018-11-18 13:46:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,318 INFO L93 Difference]: Finished difference Result 577 states and 1021 transitions. [2018-11-18 13:46:11,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 13:46:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,320 INFO L225 Difference]: With dead ends: 577 [2018-11-18 13:46:11,320 INFO L226 Difference]: Without dead ends: 391 [2018-11-18 13:46:11,321 INFO L604 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-18 13:46:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-11-18 13:46:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2018-11-18 13:46:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-18 13:46:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 683 transitions. [2018-11-18 13:46:11,332 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 683 transitions. Word has length 29 [2018-11-18 13:46:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,333 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 683 transitions. [2018-11-18 13:46:11,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 683 transitions. [2018-11-18 13:46:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 13:46:11,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,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] [2018-11-18 13:46:11,334 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1257830297, now seen corresponding path program 1 times [2018-11-18 13:46:11,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,362 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-18 13:46:11,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,363 INFO L87 Difference]: Start difference. First operand 389 states and 683 transitions. Second operand 3 states. [2018-11-18 13:46:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,388 INFO L93 Difference]: Finished difference Result 733 states and 1305 transitions. [2018-11-18 13:46:11,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 13:46:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,391 INFO L225 Difference]: With dead ends: 733 [2018-11-18 13:46:11,391 INFO L226 Difference]: Without dead ends: 731 [2018-11-18 13:46:11,392 INFO L604 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-18 13:46:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-11-18 13:46:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 529. [2018-11-18 13:46:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-18 13:46:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 919 transitions. [2018-11-18 13:46:11,407 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 919 transitions. Word has length 29 [2018-11-18 13:46:11,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,408 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 919 transitions. [2018-11-18 13:46:11,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 919 transitions. [2018-11-18 13:46:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 13:46:11,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,409 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-18 13:46:11,409 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1042992293, now seen corresponding path program 1 times [2018-11-18 13:46:11,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,430 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-18 13:46:11,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,431 INFO L87 Difference]: Start difference. First operand 529 states and 919 transitions. Second operand 3 states. [2018-11-18 13:46:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,455 INFO L93 Difference]: Finished difference Result 1269 states and 2217 transitions. [2018-11-18 13:46:11,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 13:46:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,458 INFO L225 Difference]: With dead ends: 1269 [2018-11-18 13:46:11,458 INFO L226 Difference]: Without dead ends: 755 [2018-11-18 13:46:11,459 INFO L604 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-18 13:46:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-18 13:46:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 753. [2018-11-18 13:46:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-18 13:46:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1303 transitions. [2018-11-18 13:46:11,474 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1303 transitions. Word has length 29 [2018-11-18 13:46:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,474 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1303 transitions. [2018-11-18 13:46:11,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1303 transitions. [2018-11-18 13:46:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:46:11,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,475 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-18 13:46:11,476 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash -337820759, now seen corresponding path program 1 times [2018-11-18 13:46:11,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,506 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-18 13:46:11,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,507 INFO L87 Difference]: Start difference. First operand 753 states and 1303 transitions. Second operand 3 states. [2018-11-18 13:46:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,533 INFO L93 Difference]: Finished difference Result 1129 states and 1949 transitions. [2018-11-18 13:46:11,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 13:46:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,536 INFO L225 Difference]: With dead ends: 1129 [2018-11-18 13:46:11,536 INFO L226 Difference]: Without dead ends: 763 [2018-11-18 13:46:11,536 INFO L604 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-18 13:46:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-11-18 13:46:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 761. [2018-11-18 13:46:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-18 13:46:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1303 transitions. [2018-11-18 13:46:11,549 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1303 transitions. Word has length 30 [2018-11-18 13:46:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,550 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 1303 transitions. [2018-11-18 13:46:11,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1303 transitions. [2018-11-18 13:46:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:46:11,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,551 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-18 13:46:11,551 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2026764501, now seen corresponding path program 1 times [2018-11-18 13:46:11,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,570 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-18 13:46:11,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,571 INFO L87 Difference]: Start difference. First operand 761 states and 1303 transitions. Second operand 3 states. [2018-11-18 13:46:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,591 INFO L93 Difference]: Finished difference Result 2221 states and 3801 transitions. [2018-11-18 13:46:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 13:46:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,594 INFO L225 Difference]: With dead ends: 2221 [2018-11-18 13:46:11,594 INFO L226 Difference]: Without dead ends: 1483 [2018-11-18 13:46:11,595 INFO L604 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-18 13:46:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2018-11-18 13:46:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1481. [2018-11-18 13:46:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-18 13:46:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2503 transitions. [2018-11-18 13:46:11,619 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2503 transitions. Word has length 30 [2018-11-18 13:46:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,619 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2503 transitions. [2018-11-18 13:46:11,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2503 transitions. [2018-11-18 13:46:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:46:11,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,621 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-18 13:46:11,621 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash -32619795, now seen corresponding path program 1 times [2018-11-18 13:46:11,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,654 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-18 13:46:11,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,655 INFO L87 Difference]: Start difference. First operand 1481 states and 2503 transitions. Second operand 3 states. [2018-11-18 13:46:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,674 INFO L93 Difference]: Finished difference Result 1853 states and 3193 transitions. [2018-11-18 13:46:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 13:46:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,678 INFO L225 Difference]: With dead ends: 1853 [2018-11-18 13:46:11,678 INFO L226 Difference]: Without dead ends: 1851 [2018-11-18 13:46:11,679 INFO L604 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-18 13:46:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2018-11-18 13:46:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1481. [2018-11-18 13:46:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-11-18 13:46:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2487 transitions. [2018-11-18 13:46:11,707 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2487 transitions. Word has length 30 [2018-11-18 13:46:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,707 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2487 transitions. [2018-11-18 13:46:11,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2487 transitions. [2018-11-18 13:46:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 13:46:11,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,709 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-18 13:46:11,709 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1595023034, now seen corresponding path program 1 times [2018-11-18 13:46:11,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,730 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-18 13:46:11,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,731 INFO L87 Difference]: Start difference. First operand 1481 states and 2487 transitions. Second operand 3 states. [2018-11-18 13:46:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,775 INFO L93 Difference]: Finished difference Result 2749 states and 4697 transitions. [2018-11-18 13:46:11,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 13:46:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,780 INFO L225 Difference]: With dead ends: 2749 [2018-11-18 13:46:11,780 INFO L226 Difference]: Without dead ends: 2747 [2018-11-18 13:46:11,780 INFO L604 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-18 13:46:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-11-18 13:46:11,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2073. [2018-11-18 13:46:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2018-11-18 13:46:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3415 transitions. [2018-11-18 13:46:11,812 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3415 transitions. Word has length 31 [2018-11-18 13:46:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,812 INFO L480 AbstractCegarLoop]: Abstraction has 2073 states and 3415 transitions. [2018-11-18 13:46:11,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3415 transitions. [2018-11-18 13:46:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 13:46:11,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,814 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-18 13:46:11,814 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -399121672, now seen corresponding path program 1 times [2018-11-18 13:46:11,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,837 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-18 13:46:11,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,838 INFO L87 Difference]: Start difference. First operand 2073 states and 3415 transitions. Second operand 3 states. [2018-11-18 13:46:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,873 INFO L93 Difference]: Finished difference Result 4957 states and 8217 transitions. [2018-11-18 13:46:11,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 13:46:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,878 INFO L225 Difference]: With dead ends: 4957 [2018-11-18 13:46:11,879 INFO L226 Difference]: Without dead ends: 2907 [2018-11-18 13:46:11,881 INFO L604 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-18 13:46:11,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2018-11-18 13:46:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2905. [2018-11-18 13:46:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2018-11-18 13:46:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4775 transitions. [2018-11-18 13:46:11,923 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4775 transitions. Word has length 31 [2018-11-18 13:46:11,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:11,924 INFO L480 AbstractCegarLoop]: Abstraction has 2905 states and 4775 transitions. [2018-11-18 13:46:11,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4775 transitions. [2018-11-18 13:46:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 13:46:11,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:11,926 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-18 13:46:11,926 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:11,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2093680032, now seen corresponding path program 1 times [2018-11-18 13:46:11,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:11,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:11,945 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-18 13:46:11,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:11,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:11,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:11,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:11,946 INFO L87 Difference]: Start difference. First operand 2905 states and 4775 transitions. Second operand 3 states. [2018-11-18 13:46:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:11,979 INFO L93 Difference]: Finished difference Result 4381 states and 7193 transitions. [2018-11-18 13:46:11,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:11,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 13:46:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:11,985 INFO L225 Difference]: With dead ends: 4381 [2018-11-18 13:46:11,985 INFO L226 Difference]: Without dead ends: 2955 [2018-11-18 13:46:11,987 INFO L604 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-18 13:46:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2018-11-18 13:46:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2018-11-18 13:46:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2953 states. [2018-11-18 13:46:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4807 transitions. [2018-11-18 13:46:12,029 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 4807 transitions. Word has length 32 [2018-11-18 13:46:12,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:12,029 INFO L480 AbstractCegarLoop]: Abstraction has 2953 states and 4807 transitions. [2018-11-18 13:46:12,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 4807 transitions. [2018-11-18 13:46:12,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 13:46:12,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:12,032 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-18 13:46:12,032 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:12,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:12,032 INFO L82 PathProgramCache]: Analyzing trace with hash 512343522, now seen corresponding path program 1 times [2018-11-18 13:46:12,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:12,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:12,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:12,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:12,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:12,049 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-18 13:46:12,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:12,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:12,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:12,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:12,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:12,050 INFO L87 Difference]: Start difference. First operand 2953 states and 4807 transitions. Second operand 3 states. [2018-11-18 13:46:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:12,102 INFO L93 Difference]: Finished difference Result 5389 states and 8937 transitions. [2018-11-18 13:46:12,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:12,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 13:46:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:12,111 INFO L225 Difference]: With dead ends: 5389 [2018-11-18 13:46:12,111 INFO L226 Difference]: Without dead ends: 5387 [2018-11-18 13:46:12,113 INFO L604 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-18 13:46:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-18 13:46:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 4169. [2018-11-18 13:46:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4169 states. [2018-11-18 13:46:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 6631 transitions. [2018-11-18 13:46:12,175 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 6631 transitions. Word has length 32 [2018-11-18 13:46:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:12,175 INFO L480 AbstractCegarLoop]: Abstraction has 4169 states and 6631 transitions. [2018-11-18 13:46:12,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 6631 transitions. [2018-11-18 13:46:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 13:46:12,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:12,178 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-18 13:46:12,179 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:12,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1481801184, now seen corresponding path program 1 times [2018-11-18 13:46:12,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:12,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:12,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:12,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:12,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:12,196 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-18 13:46:12,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:12,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:12,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:12,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:12,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:12,197 INFO L87 Difference]: Start difference. First operand 4169 states and 6631 transitions. Second operand 3 states. [2018-11-18 13:46:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:12,288 INFO L93 Difference]: Finished difference Result 9869 states and 15785 transitions. [2018-11-18 13:46:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:12,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 13:46:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:12,305 INFO L225 Difference]: With dead ends: 9869 [2018-11-18 13:46:12,306 INFO L226 Difference]: Without dead ends: 5771 [2018-11-18 13:46:12,312 INFO L604 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-18 13:46:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5771 states. [2018-11-18 13:46:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5771 to 5769. [2018-11-18 13:46:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-18 13:46:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 9159 transitions. [2018-11-18 13:46:12,473 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 9159 transitions. Word has length 32 [2018-11-18 13:46:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:12,473 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 9159 transitions. [2018-11-18 13:46:12,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 9159 transitions. [2018-11-18 13:46:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 13:46:12,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:12,477 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-18 13:46:12,478 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:12,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:12,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1297006195, now seen corresponding path program 1 times [2018-11-18 13:46:12,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:12,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:12,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:12,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:12,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:12,498 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-18 13:46:12,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:12,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:12,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:12,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:12,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:12,499 INFO L87 Difference]: Start difference. First operand 5769 states and 9159 transitions. Second operand 3 states. [2018-11-18 13:46:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:12,578 INFO L93 Difference]: Finished difference Result 8653 states and 13705 transitions. [2018-11-18 13:46:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:12,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 13:46:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:12,588 INFO L225 Difference]: With dead ends: 8653 [2018-11-18 13:46:12,588 INFO L226 Difference]: Without dead ends: 5835 [2018-11-18 13:46:12,593 INFO L604 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-18 13:46:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states. [2018-11-18 13:46:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 5833. [2018-11-18 13:46:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5833 states. [2018-11-18 13:46:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 9159 transitions. [2018-11-18 13:46:12,727 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 9159 transitions. Word has length 33 [2018-11-18 13:46:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:12,727 INFO L480 AbstractCegarLoop]: Abstraction has 5833 states and 9159 transitions. [2018-11-18 13:46:12,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 9159 transitions. [2018-11-18 13:46:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 13:46:12,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:12,731 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-18 13:46:12,732 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:12,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1309017359, now seen corresponding path program 1 times [2018-11-18 13:46:12,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:12,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:12,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:12,755 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-18 13:46:12,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:12,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:12,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:12,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:12,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:12,755 INFO L87 Difference]: Start difference. First operand 5833 states and 9159 transitions. Second operand 3 states. [2018-11-18 13:46:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:12,880 INFO L93 Difference]: Finished difference Result 10509 states and 16841 transitions. [2018-11-18 13:46:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:12,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 13:46:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:12,898 INFO L225 Difference]: With dead ends: 10509 [2018-11-18 13:46:12,898 INFO L226 Difference]: Without dead ends: 10507 [2018-11-18 13:46:12,902 INFO L604 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-18 13:46:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2018-11-18 13:46:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 8329. [2018-11-18 13:46:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states. [2018-11-18 13:46:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 12743 transitions. [2018-11-18 13:46:13,069 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 12743 transitions. Word has length 33 [2018-11-18 13:46:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:13,069 INFO L480 AbstractCegarLoop]: Abstraction has 8329 states and 12743 transitions. [2018-11-18 13:46:13,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 12743 transitions. [2018-11-18 13:46:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 13:46:13,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:13,077 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-18 13:46:13,078 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:13,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash -685127347, now seen corresponding path program 1 times [2018-11-18 13:46:13,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:13,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:13,102 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-18 13:46:13,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:13,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:13,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:13,103 INFO L87 Difference]: Start difference. First operand 8329 states and 12743 transitions. Second operand 3 states. [2018-11-18 13:46:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:13,270 INFO L93 Difference]: Finished difference Result 19597 states and 30153 transitions. [2018-11-18 13:46:13,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:13,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 13:46:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:13,287 INFO L225 Difference]: With dead ends: 19597 [2018-11-18 13:46:13,287 INFO L226 Difference]: Without dead ends: 11403 [2018-11-18 13:46:13,300 INFO L604 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-18 13:46:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11403 states. [2018-11-18 13:46:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11403 to 11401. [2018-11-18 13:46:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11401 states. [2018-11-18 13:46:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11401 states to 11401 states and 17415 transitions. [2018-11-18 13:46:13,548 INFO L78 Accepts]: Start accepts. Automaton has 11401 states and 17415 transitions. Word has length 33 [2018-11-18 13:46:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:13,548 INFO L480 AbstractCegarLoop]: Abstraction has 11401 states and 17415 transitions. [2018-11-18 13:46:13,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 11401 states and 17415 transitions. [2018-11-18 13:46:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 13:46:13,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:13,557 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-18 13:46:13,557 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:13,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:13,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1925046613, now seen corresponding path program 1 times [2018-11-18 13:46:13,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:13,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:13,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:13,586 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-18 13:46:13,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:13,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:13,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:13,587 INFO L87 Difference]: Start difference. First operand 11401 states and 17415 transitions. Second operand 3 states. [2018-11-18 13:46:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:13,729 INFO L93 Difference]: Finished difference Result 17101 states and 26057 transitions. [2018-11-18 13:46:13,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:13,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 13:46:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:13,745 INFO L225 Difference]: With dead ends: 17101 [2018-11-18 13:46:13,746 INFO L226 Difference]: Without dead ends: 11531 [2018-11-18 13:46:13,755 INFO L604 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-18 13:46:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11531 states. [2018-11-18 13:46:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11531 to 11529. [2018-11-18 13:46:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11529 states. [2018-11-18 13:46:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11529 states to 11529 states and 17415 transitions. [2018-11-18 13:46:13,969 INFO L78 Accepts]: Start accepts. Automaton has 11529 states and 17415 transitions. Word has length 34 [2018-11-18 13:46:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:13,969 INFO L480 AbstractCegarLoop]: Abstraction has 11529 states and 17415 transitions. [2018-11-18 13:46:13,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 11529 states and 17415 transitions. [2018-11-18 13:46:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 13:46:13,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:13,978 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-18 13:46:13,978 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:13,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash 236102871, now seen corresponding path program 1 times [2018-11-18 13:46:13,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:13,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:13,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:13,993 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-18 13:46:13,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:13,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:13,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:13,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:13,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:13,995 INFO L87 Difference]: Start difference. First operand 11529 states and 17415 transitions. Second operand 3 states. [2018-11-18 13:46:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:14,268 INFO L93 Difference]: Finished difference Result 20493 states and 31625 transitions. [2018-11-18 13:46:14,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:14,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 13:46:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:14,296 INFO L225 Difference]: With dead ends: 20493 [2018-11-18 13:46:14,296 INFO L226 Difference]: Without dead ends: 20491 [2018-11-18 13:46:14,300 INFO L604 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-18 13:46:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2018-11-18 13:46:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 16649. [2018-11-18 13:46:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16649 states. [2018-11-18 13:46:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 24455 transitions. [2018-11-18 13:46:14,586 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 24455 transitions. Word has length 34 [2018-11-18 13:46:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:14,587 INFO L480 AbstractCegarLoop]: Abstraction has 16649 states and 24455 transitions. [2018-11-18 13:46:14,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 24455 transitions. [2018-11-18 13:46:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 13:46:14,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:14,602 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-18 13:46:14,603 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:14,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:14,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1758041835, now seen corresponding path program 1 times [2018-11-18 13:46:14,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:14,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:14,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:14,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:14,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:14,617 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-18 13:46:14,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:14,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:14,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:14,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:14,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:14,618 INFO L87 Difference]: Start difference. First operand 16649 states and 24455 transitions. Second operand 3 states. [2018-11-18 13:46:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:14,939 INFO L93 Difference]: Finished difference Result 38925 states and 57481 transitions. [2018-11-18 13:46:14,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:14,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 13:46:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:14,973 INFO L225 Difference]: With dead ends: 38925 [2018-11-18 13:46:14,973 INFO L226 Difference]: Without dead ends: 22539 [2018-11-18 13:46:14,996 INFO L604 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-18 13:46:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22539 states. [2018-11-18 13:46:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22539 to 22537. [2018-11-18 13:46:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22537 states. [2018-11-18 13:46:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22537 states to 22537 states and 33031 transitions. [2018-11-18 13:46:15,514 INFO L78 Accepts]: Start accepts. Automaton has 22537 states and 33031 transitions. Word has length 34 [2018-11-18 13:46:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:15,514 INFO L480 AbstractCegarLoop]: Abstraction has 22537 states and 33031 transitions. [2018-11-18 13:46:15,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22537 states and 33031 transitions. [2018-11-18 13:46:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 13:46:15,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:15,531 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-18 13:46:15,531 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:15,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1270531102, now seen corresponding path program 1 times [2018-11-18 13:46:15,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:15,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:15,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:15,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:15,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:15,547 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-18 13:46:15,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:15,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:15,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:15,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:15,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:15,547 INFO L87 Difference]: Start difference. First operand 22537 states and 33031 transitions. Second operand 3 states. [2018-11-18 13:46:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:15,822 INFO L93 Difference]: Finished difference Result 33805 states and 49417 transitions. [2018-11-18 13:46:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:15,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 13:46:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:15,854 INFO L225 Difference]: With dead ends: 33805 [2018-11-18 13:46:15,854 INFO L226 Difference]: Without dead ends: 22795 [2018-11-18 13:46:15,872 INFO L604 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-18 13:46:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22795 states. [2018-11-18 13:46:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22795 to 22793. [2018-11-18 13:46:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22793 states. [2018-11-18 13:46:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22793 states to 22793 states and 33031 transitions. [2018-11-18 13:46:16,345 INFO L78 Accepts]: Start accepts. Automaton has 22793 states and 33031 transitions. Word has length 35 [2018-11-18 13:46:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:16,345 INFO L480 AbstractCegarLoop]: Abstraction has 22793 states and 33031 transitions. [2018-11-18 13:46:16,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22793 states and 33031 transitions. [2018-11-18 13:46:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 13:46:16,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:16,361 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-18 13:46:16,361 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:16,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:16,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1335492452, now seen corresponding path program 1 times [2018-11-18 13:46:16,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:16,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:16,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:16,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:16,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:16,376 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-18 13:46:16,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:16,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:16,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:16,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:16,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:16,377 INFO L87 Difference]: Start difference. First operand 22793 states and 33031 transitions. Second operand 3 states. [2018-11-18 13:46:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:16,811 INFO L93 Difference]: Finished difference Result 39949 states and 59145 transitions. [2018-11-18 13:46:16,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:16,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 13:46:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:16,856 INFO L225 Difference]: With dead ends: 39949 [2018-11-18 13:46:16,856 INFO L226 Difference]: Without dead ends: 39947 [2018-11-18 13:46:16,867 INFO L604 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-18 13:46:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39947 states. [2018-11-18 13:46:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39947 to 33289. [2018-11-18 13:46:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33289 states. [2018-11-18 13:46:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33289 states to 33289 states and 46855 transitions. [2018-11-18 13:46:17,471 INFO L78 Accepts]: Start accepts. Automaton has 33289 states and 46855 transitions. Word has length 35 [2018-11-18 13:46:17,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:17,471 INFO L480 AbstractCegarLoop]: Abstraction has 33289 states and 46855 transitions. [2018-11-18 13:46:17,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 33289 states and 46855 transitions. [2018-11-18 13:46:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 13:46:17,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:17,497 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-18 13:46:17,497 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:17,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash -658652254, now seen corresponding path program 1 times [2018-11-18 13:46:17,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:17,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:17,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:17,514 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-18 13:46:17,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:17,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:17,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:17,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:17,515 INFO L87 Difference]: Start difference. First operand 33289 states and 46855 transitions. Second operand 3 states. [2018-11-18 13:46:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:18,155 INFO L93 Difference]: Finished difference Result 77325 states and 109321 transitions. [2018-11-18 13:46:18,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:18,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-18 13:46:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:18,198 INFO L225 Difference]: With dead ends: 77325 [2018-11-18 13:46:18,198 INFO L226 Difference]: Without dead ends: 44555 [2018-11-18 13:46:18,229 INFO L604 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-18 13:46:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44555 states. [2018-11-18 13:46:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44555 to 44553. [2018-11-18 13:46:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44553 states. [2018-11-18 13:46:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44553 states to 44553 states and 62471 transitions. [2018-11-18 13:46:19,153 INFO L78 Accepts]: Start accepts. Automaton has 44553 states and 62471 transitions. Word has length 35 [2018-11-18 13:46:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:19,153 INFO L480 AbstractCegarLoop]: Abstraction has 44553 states and 62471 transitions. [2018-11-18 13:46:19,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44553 states and 62471 transitions. [2018-11-18 13:46:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 13:46:19,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:19,166 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-18 13:46:19,166 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:19,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:19,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1549192118, now seen corresponding path program 1 times [2018-11-18 13:46:19,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:19,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:19,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:19,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:19,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:19,180 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-18 13:46:19,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:19,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:19,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:19,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:19,181 INFO L87 Difference]: Start difference. First operand 44553 states and 62471 transitions. Second operand 3 states. [2018-11-18 13:46:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:19,546 INFO L93 Difference]: Finished difference Result 66829 states and 93449 transitions. [2018-11-18 13:46:19,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:19,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 13:46:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:19,578 INFO L225 Difference]: With dead ends: 66829 [2018-11-18 13:46:19,578 INFO L226 Difference]: Without dead ends: 45067 [2018-11-18 13:46:19,596 INFO L604 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-18 13:46:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45067 states. [2018-11-18 13:46:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45067 to 45065. [2018-11-18 13:46:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45065 states. [2018-11-18 13:46:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45065 states to 45065 states and 62471 transitions. [2018-11-18 13:46:20,121 INFO L78 Accepts]: Start accepts. Automaton has 45065 states and 62471 transitions. Word has length 36 [2018-11-18 13:46:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:20,121 INFO L480 AbstractCegarLoop]: Abstraction has 45065 states and 62471 transitions. [2018-11-18 13:46:20,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 45065 states and 62471 transitions. [2018-11-18 13:46:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 13:46:20,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:20,138 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-18 13:46:20,138 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:20,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:20,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1056831436, now seen corresponding path program 1 times [2018-11-18 13:46:20,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:20,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:20,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:20,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:20,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:20,174 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-18 13:46:20,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:20,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:20,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:20,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:20,175 INFO L87 Difference]: Start difference. First operand 45065 states and 62471 transitions. Second operand 3 states. [2018-11-18 13:46:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:20,970 INFO L93 Difference]: Finished difference Result 77837 states and 110089 transitions. [2018-11-18 13:46:20,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:20,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 13:46:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:21,018 INFO L225 Difference]: With dead ends: 77837 [2018-11-18 13:46:21,019 INFO L226 Difference]: Without dead ends: 77835 [2018-11-18 13:46:21,026 INFO L604 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-18 13:46:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77835 states. [2018-11-18 13:46:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77835 to 66569. [2018-11-18 13:46:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66569 states. [2018-11-18 13:46:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66569 states to 66569 states and 89607 transitions. [2018-11-18 13:46:21,896 INFO L78 Accepts]: Start accepts. Automaton has 66569 states and 89607 transitions. Word has length 36 [2018-11-18 13:46:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:21,896 INFO L480 AbstractCegarLoop]: Abstraction has 66569 states and 89607 transitions. [2018-11-18 13:46:21,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 66569 states and 89607 transitions. [2018-11-18 13:46:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 13:46:21,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:21,917 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-18 13:46:21,917 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:21,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:21,917 INFO L82 PathProgramCache]: Analyzing trace with hash -937313270, now seen corresponding path program 1 times [2018-11-18 13:46:21,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:21,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:21,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:21,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:21,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:21,950 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-18 13:46:21,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:21,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:21,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:21,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:21,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:21,951 INFO L87 Difference]: Start difference. First operand 66569 states and 89607 transitions. Second operand 3 states. [2018-11-18 13:46:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:22,628 INFO L93 Difference]: Finished difference Result 153613 states and 207369 transitions. [2018-11-18 13:46:22,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:22,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 13:46:22,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:22,694 INFO L225 Difference]: With dead ends: 153613 [2018-11-18 13:46:22,694 INFO L226 Difference]: Without dead ends: 88075 [2018-11-18 13:46:22,741 INFO L604 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-18 13:46:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88075 states. [2018-11-18 13:46:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88075 to 88073. [2018-11-18 13:46:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88073 states. [2018-11-18 13:46:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88073 states to 88073 states and 117767 transitions. [2018-11-18 13:46:24,003 INFO L78 Accepts]: Start accepts. Automaton has 88073 states and 117767 transitions. Word has length 36 [2018-11-18 13:46:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:24,003 INFO L480 AbstractCegarLoop]: Abstraction has 88073 states and 117767 transitions. [2018-11-18 13:46:24,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 88073 states and 117767 transitions. [2018-11-18 13:46:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 13:46:24,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:24,031 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, 1] [2018-11-18 13:46:24,031 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:24,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:24,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1597748681, now seen corresponding path program 1 times [2018-11-18 13:46:24,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:24,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:24,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:24,066 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-18 13:46:24,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:24,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:24,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:24,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:24,067 INFO L87 Difference]: Start difference. First operand 88073 states and 117767 transitions. Second operand 3 states. [2018-11-18 13:46:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:24,753 INFO L93 Difference]: Finished difference Result 132109 states and 176137 transitions. [2018-11-18 13:46:24,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:24,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 13:46:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:24,821 INFO L225 Difference]: With dead ends: 132109 [2018-11-18 13:46:24,822 INFO L226 Difference]: Without dead ends: 89099 [2018-11-18 13:46:24,853 INFO L604 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-18 13:46:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89099 states. [2018-11-18 13:46:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89099 to 89097. [2018-11-18 13:46:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89097 states. [2018-11-18 13:46:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89097 states to 89097 states and 117767 transitions. [2018-11-18 13:46:26,034 INFO L78 Accepts]: Start accepts. Automaton has 89097 states and 117767 transitions. Word has length 37 [2018-11-18 13:46:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:26,035 INFO L480 AbstractCegarLoop]: Abstraction has 89097 states and 117767 transitions. [2018-11-18 13:46:26,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 89097 states and 117767 transitions. [2018-11-18 13:46:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 13:46:26,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:26,060 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, 1] [2018-11-18 13:46:26,060 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:26,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1008274873, now seen corresponding path program 1 times [2018-11-18 13:46:26,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:26,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:26,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:26,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:26,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:26,085 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-18 13:46:26,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:26,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:26,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:26,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:26,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:26,086 INFO L87 Difference]: Start difference. First operand 89097 states and 117767 transitions. Second operand 3 states. [2018-11-18 13:46:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:27,187 INFO L93 Difference]: Finished difference Result 151565 states and 203785 transitions. [2018-11-18 13:46:27,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:27,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 13:46:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:27,310 INFO L225 Difference]: With dead ends: 151565 [2018-11-18 13:46:27,310 INFO L226 Difference]: Without dead ends: 151563 [2018-11-18 13:46:27,340 INFO L604 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-18 13:46:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151563 states. [2018-11-18 13:46:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151563 to 133129. [2018-11-18 13:46:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133129 states. [2018-11-18 13:46:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133129 states to 133129 states and 171015 transitions. [2018-11-18 13:46:28,908 INFO L78 Accepts]: Start accepts. Automaton has 133129 states and 171015 transitions. Word has length 37 [2018-11-18 13:46:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:28,908 INFO L480 AbstractCegarLoop]: Abstraction has 133129 states and 171015 transitions. [2018-11-18 13:46:28,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 133129 states and 171015 transitions. [2018-11-18 13:46:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 13:46:28,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:28,959 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, 1] [2018-11-18 13:46:28,959 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:28,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash -985869833, now seen corresponding path program 1 times [2018-11-18 13:46:28,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:28,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:28,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:46:28,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:28,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:28,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:28,984 INFO L87 Difference]: Start difference. First operand 133129 states and 171015 transitions. Second operand 3 states. [2018-11-18 13:46:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:30,650 INFO L93 Difference]: Finished difference Result 305165 states and 392201 transitions. [2018-11-18 13:46:30,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:30,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-18 13:46:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:30,776 INFO L225 Difference]: With dead ends: 305165 [2018-11-18 13:46:30,776 INFO L226 Difference]: Without dead ends: 174091 [2018-11-18 13:46:30,842 INFO L604 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-18 13:46:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174091 states. [2018-11-18 13:46:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174091 to 174089. [2018-11-18 13:46:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174089 states. [2018-11-18 13:46:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174089 states to 174089 states and 221191 transitions. [2018-11-18 13:46:33,006 INFO L78 Accepts]: Start accepts. Automaton has 174089 states and 221191 transitions. Word has length 37 [2018-11-18 13:46:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:33,007 INFO L480 AbstractCegarLoop]: Abstraction has 174089 states and 221191 transitions. [2018-11-18 13:46:33,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 174089 states and 221191 transitions. [2018-11-18 13:46:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 13:46:33,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:33,079 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, 1, 1] [2018-11-18 13:46:33,079 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:33,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:33,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1191965503, now seen corresponding path program 1 times [2018-11-18 13:46:33,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:33,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:33,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:33,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:33,111 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-18 13:46:33,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:33,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:33,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:33,112 INFO L87 Difference]: Start difference. First operand 174089 states and 221191 transitions. Second operand 3 states. [2018-11-18 13:46:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:34,740 INFO L93 Difference]: Finished difference Result 261133 states and 330761 transitions. [2018-11-18 13:46:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:34,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 13:46:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:34,877 INFO L225 Difference]: With dead ends: 261133 [2018-11-18 13:46:34,877 INFO L226 Difference]: Without dead ends: 176139 [2018-11-18 13:46:34,936 INFO L604 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-18 13:46:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176139 states. [2018-11-18 13:46:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176139 to 176137. [2018-11-18 13:46:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176137 states. [2018-11-18 13:46:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176137 states to 176137 states and 221191 transitions. [2018-11-18 13:46:39,514 INFO L78 Accepts]: Start accepts. Automaton has 176137 states and 221191 transitions. Word has length 38 [2018-11-18 13:46:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:39,514 INFO L480 AbstractCegarLoop]: Abstraction has 176137 states and 221191 transitions. [2018-11-18 13:46:39,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 176137 states and 221191 transitions. [2018-11-18 13:46:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 13:46:39,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:39,571 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, 1, 1] [2018-11-18 13:46:39,571 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:39,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash -496978239, now seen corresponding path program 1 times [2018-11-18 13:46:39,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:39,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:39,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:39,617 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-18 13:46:39,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:39,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:39,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:39,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:39,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:39,618 INFO L87 Difference]: Start difference. First operand 176137 states and 221191 transitions. Second operand 3 states. [2018-11-18 13:46:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:42,339 INFO L93 Difference]: Finished difference Result 516109 states and 638985 transitions. [2018-11-18 13:46:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:42,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 13:46:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:42,661 INFO L225 Difference]: With dead ends: 516109 [2018-11-18 13:46:42,662 INFO L226 Difference]: Without dead ends: 344075 [2018-11-18 13:46:42,789 INFO L604 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-18 13:46:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344075 states. [2018-11-18 13:46:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344075 to 344073. [2018-11-18 13:46:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344073 states. [2018-11-18 13:46:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344073 states to 344073 states and 417799 transitions. [2018-11-18 13:46:47,415 INFO L78 Accepts]: Start accepts. Automaton has 344073 states and 417799 transitions. Word has length 38 [2018-11-18 13:46:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:46:47,416 INFO L480 AbstractCegarLoop]: Abstraction has 344073 states and 417799 transitions. [2018-11-18 13:46:47,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:46:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 344073 states and 417799 transitions. [2018-11-18 13:46:47,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 13:46:47,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:46:47,535 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, 1, 1] [2018-11-18 13:46:47,535 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:46:47,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:46:47,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1497166467, now seen corresponding path program 1 times [2018-11-18 13:46:47,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:46:47,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:46:47,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:47,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:46:47,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:46:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:46:47,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-18 13:46:47,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:46:47,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:46:47,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:46:47,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:46:47,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:46:47,565 INFO L87 Difference]: Start difference. First operand 344073 states and 417799 transitions. Second operand 3 states. [2018-11-18 13:46:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:46:51,396 INFO L93 Difference]: Finished difference Result 372749 states and 462857 transitions. [2018-11-18 13:46:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:46:51,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-18 13:46:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:46:51,732 INFO L225 Difference]: With dead ends: 372749 [2018-11-18 13:46:51,732 INFO L226 Difference]: Without dead ends: 372747 [2018-11-18 13:46:51,800 INFO L604 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-18 13:46:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372747 states. [2018-11-18 13:46:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372747 to 344073. [2018-11-18 13:46:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344073 states. [2018-11-18 13:47:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344073 states to 344073 states and 413703 transitions. [2018-11-18 13:47:00,011 INFO L78 Accepts]: Start accepts. Automaton has 344073 states and 413703 transitions. Word has length 38 [2018-11-18 13:47:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:00,012 INFO L480 AbstractCegarLoop]: Abstraction has 344073 states and 413703 transitions. [2018-11-18 13:47:00,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:47:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 344073 states and 413703 transitions. [2018-11-18 13:47:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 13:47:00,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:00,131 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, 1, 1, 1] [2018-11-18 13:47:00,131 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:47:00,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1773759628, now seen corresponding path program 1 times [2018-11-18 13:47:00,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:47:00,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:47:00,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:47:00,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:00,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:47:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:00,165 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-18 13:47:00,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:00,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:47:00,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:47:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:47:00,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:47:00,166 INFO L87 Difference]: Start difference. First operand 344073 states and 413703 transitions. Second operand 3 states. [2018-11-18 13:47:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:05,293 INFO L93 Difference]: Finished difference Result 569357 states and 688137 transitions. [2018-11-18 13:47:05,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:47:05,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 13:47:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:05,729 INFO L225 Difference]: With dead ends: 569357 [2018-11-18 13:47:05,730 INFO L226 Difference]: Without dead ends: 569355 [2018-11-18 13:47:05,787 INFO L604 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-18 13:47:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569355 states. [2018-11-18 13:47:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569355 to 528393. [2018-11-18 13:47:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528393 states. [2018-11-18 13:47:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528393 states to 528393 states and 622599 transitions. [2018-11-18 13:47:12,114 INFO L78 Accepts]: Start accepts. Automaton has 528393 states and 622599 transitions. Word has length 39 [2018-11-18 13:47:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:12,115 INFO L480 AbstractCegarLoop]: Abstraction has 528393 states and 622599 transitions. [2018-11-18 13:47:12,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:47:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 528393 states and 622599 transitions. [2018-11-18 13:47:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 13:47:12,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:12,361 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, 1, 1, 1] [2018-11-18 13:47:12,361 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:47:12,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash -220385078, now seen corresponding path program 1 times [2018-11-18 13:47:12,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:47:12,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:47:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:47:12,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:47:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:12,393 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-18 13:47:12,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:12,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:47:12,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:47:12,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:47:12,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:47:12,394 INFO L87 Difference]: Start difference. First operand 528393 states and 622599 transitions. Second operand 3 states. [2018-11-18 13:47:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:22,070 INFO L93 Difference]: Finished difference Result 1200141 states and 1409033 transitions. [2018-11-18 13:47:22,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:47:22,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 13:47:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:22,564 INFO L225 Difference]: With dead ends: 1200141 [2018-11-18 13:47:22,565 INFO L226 Difference]: Without dead ends: 675851 [2018-11-18 13:47:22,765 INFO L604 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-18 13:47:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675851 states. [2018-11-18 13:47:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675851 to 675849. [2018-11-18 13:47:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675849 states. [2018-11-18 13:47:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675849 states to 675849 states and 778247 transitions. [2018-11-18 13:47:32,329 INFO L78 Accepts]: Start accepts. Automaton has 675849 states and 778247 transitions. Word has length 39 [2018-11-18 13:47:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:32,329 INFO L480 AbstractCegarLoop]: Abstraction has 675849 states and 778247 transitions. [2018-11-18 13:47:32,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:47:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 675849 states and 778247 transitions. [2018-11-18 13:47:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:47:32,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:32,574 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, 1, 1, 1, 1] [2018-11-18 13:47:32,574 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:47:32,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash -847810186, now seen corresponding path program 1 times [2018-11-18 13:47:32,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:47:32,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:47:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:47:32,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:47:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:32,599 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-18 13:47:32,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:32,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:47:32,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:47:32,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:47:32,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:47:32,600 INFO L87 Difference]: Start difference. First operand 675849 states and 778247 transitions. Second operand 3 states. [2018-11-18 13:47:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:47:42,457 INFO L93 Difference]: Finished difference Result 1019917 states and 1175561 transitions. [2018-11-18 13:47:42,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:47:42,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 13:47:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:47:43,019 INFO L225 Difference]: With dead ends: 1019917 [2018-11-18 13:47:43,019 INFO L226 Difference]: Without dead ends: 688139 [2018-11-18 13:47:43,219 INFO L604 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-18 13:47:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688139 states. [2018-11-18 13:47:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688139 to 688137. [2018-11-18 13:47:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688137 states. [2018-11-18 13:47:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688137 states to 688137 states and 786439 transitions. [2018-11-18 13:47:53,175 INFO L78 Accepts]: Start accepts. Automaton has 688137 states and 786439 transitions. Word has length 40 [2018-11-18 13:47:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:47:53,175 INFO L480 AbstractCegarLoop]: Abstraction has 688137 states and 786439 transitions. [2018-11-18 13:47:53,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:47:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 688137 states and 786439 transitions. [2018-11-18 13:47:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:47:53,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:47:53,465 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, 1, 1, 1, 1] [2018-11-18 13:47:53,466 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:47:53,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:47:53,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1758213368, now seen corresponding path program 1 times [2018-11-18 13:47:53,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:47:53,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:47:53,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:47:53,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:47:53,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:47:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:47:53,494 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-18 13:47:53,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:47:53,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:47:53,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:47:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:47:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:47:53,495 INFO L87 Difference]: Start difference. First operand 688137 states and 786439 transitions. Second operand 3 states. [2018-11-18 13:48:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:48:09,315 INFO L93 Difference]: Finished difference Result 1114123 states and 1261576 transitions. [2018-11-18 13:48:09,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:48:09,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 13:48:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:48:10,251 INFO L225 Difference]: With dead ends: 1114123 [2018-11-18 13:48:10,251 INFO L226 Difference]: Without dead ends: 1114121 [2018-11-18 13:48:10,366 INFO L604 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-18 13:48:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114121 states. [2018-11-18 13:48:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114121 to 1064969. [2018-11-18 13:48:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064969 states. [2018-11-18 13:48:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064969 states to 1064969 states and 1196039 transitions. [2018-11-18 13:48:26,129 INFO L78 Accepts]: Start accepts. Automaton has 1064969 states and 1196039 transitions. Word has length 40 [2018-11-18 13:48:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:48:26,130 INFO L480 AbstractCegarLoop]: Abstraction has 1064969 states and 1196039 transitions. [2018-11-18 13:48:26,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:48:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1064969 states and 1196039 transitions. [2018-11-18 13:48:26,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:48:26,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:48:26,745 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, 1, 1, 1, 1] [2018-11-18 13:48:26,745 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:48:26,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:48:26,746 INFO L82 PathProgramCache]: Analyzing trace with hash -235931338, now seen corresponding path program 1 times [2018-11-18 13:48:26,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:48:26,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:48:26,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:26,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:48:26,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:48:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:48:26,786 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-18 13:48:26,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:48:26,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:48:26,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:48:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:48:26,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:48:26,787 INFO L87 Difference]: Start difference. First operand 1064969 states and 1196039 transitions. Second operand 3 states. [2018-11-18 13:48:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:48:47,812 INFO L93 Difference]: Finished difference Result 2392073 states and 2654215 transitions. [2018-11-18 13:48:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:48:47,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 13:48:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:48:47,813 INFO L225 Difference]: With dead ends: 2392073 [2018-11-18 13:48:47,813 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 13:48:48,400 INFO L604 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-18 13:48:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 13:48:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 13:48:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 13:48:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:48:48,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-18 13:48:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:48:48,401 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:48:48,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:48:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:48:48,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 13:48:48,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 13:48:48,476 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 13:48:48,476 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:48:48,476 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:48:48,476 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 13:48:48,476 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 13:48:48,476 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:48:48,476 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-11-18 13:48:48,476 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-18 13:48:48,477 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L428 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L421 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-18 13:48:48,478 INFO L425 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L428 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,479 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-11-18 13:48:48,480 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,480 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,480 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,480 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-18 13:48:48,480 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-11-18 13:48:48,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:48:48 BoogieIcfgContainer [2018-11-18 13:48:48,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:48:48,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:48:48,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:48:48,486 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:48:48,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:46:10" (3/4) ... [2018-11-18 13:48:48,490 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 13:48:48,496 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 13:48:48,496 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 13:48:48,501 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 13:48:48,502 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 13:48:48,502 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 13:48:48,550 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1cc5bd57-3fd9-4d55-9187-92a24e90f835/bin-2019/uautomizer/witness.graphml [2018-11-18 13:48:48,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:48:48,551 INFO L168 Benchmark]: Toolchain (without parser) took 158663.15 ms. Allocated memory was 1.0 GB in the beginning and 8.2 GB in the end (delta: 7.1 GB). Free memory was 960.3 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-11-18 13:48:48,553 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-18 13:48:48,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.75 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:48:48,554 INFO L168 Benchmark]: Boogie Preprocessor took 64.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:48:48,554 INFO L168 Benchmark]: RCFGBuilder took 312.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:48:48,554 INFO L168 Benchmark]: TraceAbstraction took 158050.03 ms. Allocated memory was 1.2 GB in the beginning and 8.2 GB in the end (delta: 7.0 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-11-18 13:48:48,554 INFO L168 Benchmark]: Witness Printer took 64.18 ms. Allocated memory is still 8.2 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 192.9 kB). Peak memory consumption was 192.9 kB. Max. memory is 11.5 GB. [2018-11-18 13:48:48,556 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 169.75 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 946.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 312.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 158050.03 ms. Allocated memory was 1.2 GB in the beginning and 8.2 GB in the end (delta: 7.0 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 64.18 ms. Allocated memory is still 8.2 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 192.9 kB). Peak memory consumption was 192.9 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: 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: 54]: 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, 60 locations, 1 error locations. SAFE Result, 158.0s OverallTime, 42 OverallIterations, 1 TraceHistogramMax, 83.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5286 SDtfs, 2640 SDslu, 3629 SDs, 0 SdLazy, 223 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1064969occurred in iteration=41, 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: 70.6s AutomataMinimizationTime, 42 MinimizatonAttempts, 163885 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 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.8s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1347 ConstructedInterpolants, 0 QuantifiedInterpolants, 91126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...