./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:00:41,111 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:00:41,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:00:41,120 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:00:41,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:00:41,121 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:00:41,121 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:00:41,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:00:41,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:00:41,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:00:41,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:00:41,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:00:41,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:00:41,126 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:00:41,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:00:41,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:00:41,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:00:41,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:00:41,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:00:41,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:00:41,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:00:41,133 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:00:41,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:00:41,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:00:41,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:00:41,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:00:41,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:00:41,136 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:00:41,137 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:00:41,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:00:41,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:00:41,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:00:41,138 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:00:41,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:00:41,139 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:00:41,140 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:00:41,140 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 08:00:41,149 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:00:41,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:00:41,150 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:00:41,150 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 08:00:41,151 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:00:41,151 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:00:41,151 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:00:41,151 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:00:41,151 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:00:41,151 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:00:41,152 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:00:41,152 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:00:41,152 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:00:41,152 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:00:41,152 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:00:41,152 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:00:41,152 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:00:41,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:00:41,153 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:00:41,153 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:00:41,153 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:00:41,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:00:41,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:00:41,153 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:00:41,153 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:00:41,153 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:00:41,153 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:00:41,154 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:00:41,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:00:41,154 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_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-11-10 08:00:41,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:00:41,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:00:41,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:00:41,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:00:41,185 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:00:41,186 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 08:00:41,223 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/data/4e6501866/ad194ad7c2824bfeb9e13aef3dcc24fd/FLAGfd01d8b0c [2018-11-10 08:00:41,625 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:00:41,626 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 08:00:41,631 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/data/4e6501866/ad194ad7c2824bfeb9e13aef3dcc24fd/FLAGfd01d8b0c [2018-11-10 08:00:41,641 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/data/4e6501866/ad194ad7c2824bfeb9e13aef3dcc24fd [2018-11-10 08:00:41,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:00:41,645 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 08:00:41,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:00:41,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:00:41,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:00:41,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:00:41" (1/1) ... [2018-11-10 08:00:41,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41, skipping insertion in model container [2018-11-10 08:00:41,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:00:41" (1/1) ... [2018-11-10 08:00:41,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:00:41,670 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:00:41,778 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:00:41,781 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:00:41,798 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:00:41,806 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:00:41,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41 WrapperNode [2018-11-10 08:00:41,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:00:41,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:00:41,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:00:41,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:00:41,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41" (1/1) ... [2018-11-10 08:00:41,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41" (1/1) ... [2018-11-10 08:00:41,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41" (1/1) ... [2018-11-10 08:00:41,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41" (1/1) ... [2018-11-10 08:00:41,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41" (1/1) ... [2018-11-10 08:00:41,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41" (1/1) ... [2018-11-10 08:00:41,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41" (1/1) ... [2018-11-10 08:00:41,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:00:41,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:00:41,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:00:41,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:00:41,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:00:41,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:00:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:00:41,913 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:00:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 08:00:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 08:00:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:00:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:00:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:00:42,096 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:00:42,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:00:42 BoogieIcfgContainer [2018-11-10 08:00:42,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:00:42,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:00:42,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:00:42,100 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:00:42,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:00:41" (1/3) ... [2018-11-10 08:00:42,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d34651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:00:42, skipping insertion in model container [2018-11-10 08:00:42,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:00:41" (2/3) ... [2018-11-10 08:00:42,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d34651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:00:42, skipping insertion in model container [2018-11-10 08:00:42,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:00:42" (3/3) ... [2018-11-10 08:00:42,103 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 08:00:42,111 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:00:42,117 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 08:00:42,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 08:00:42,158 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:00:42,159 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:00:42,159 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:00:42,159 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:00:42,159 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:00:42,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:00:42,160 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:00:42,160 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:00:42,160 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:00:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-10 08:00:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 08:00:42,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,180 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] [2018-11-10 08:00:42,182 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash 322166107, now seen corresponding path program 1 times [2018-11-10 08:00:42,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,346 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2018-11-10 08:00:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:42,391 INFO L93 Difference]: Finished difference Result 101 states and 176 transitions. [2018-11-10 08:00:42,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:42,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 08:00:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:42,402 INFO L225 Difference]: With dead ends: 101 [2018-11-10 08:00:42,402 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 08:00:42,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 08:00:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2018-11-10 08:00:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 08:00:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2018-11-10 08:00:42,431 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2018-11-10 08:00:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:42,431 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2018-11-10 08:00:42,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2018-11-10 08:00:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 08:00:42,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,432 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] [2018-11-10 08:00:42,432 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,432 INFO L82 PathProgramCache]: Analyzing trace with hash -957697571, now seen corresponding path program 1 times [2018-11-10 08:00:42,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,482 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand 3 states. [2018-11-10 08:00:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:42,513 INFO L93 Difference]: Finished difference Result 140 states and 255 transitions. [2018-11-10 08:00:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:42,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 08:00:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:42,515 INFO L225 Difference]: With dead ends: 140 [2018-11-10 08:00:42,515 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 08:00:42,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 08:00:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-10 08:00:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 08:00:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 151 transitions. [2018-11-10 08:00:42,525 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 151 transitions. Word has length 23 [2018-11-10 08:00:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:42,525 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 151 transitions. [2018-11-10 08:00:42,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 151 transitions. [2018-11-10 08:00:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 08:00:42,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:42,527 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1397427458, now seen corresponding path program 1 times [2018-11-10 08:00:42,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,565 INFO L87 Difference]: Start difference. First operand 84 states and 151 transitions. Second operand 3 states. [2018-11-10 08:00:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:42,575 INFO L93 Difference]: Finished difference Result 130 states and 229 transitions. [2018-11-10 08:00:42,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:42,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 08:00:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:42,576 INFO L225 Difference]: With dead ends: 130 [2018-11-10 08:00:42,577 INFO L226 Difference]: Without dead ends: 90 [2018-11-10 08:00:42,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-10 08:00:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-10 08:00:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 08:00:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 154 transitions. [2018-11-10 08:00:42,582 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 154 transitions. Word has length 24 [2018-11-10 08:00:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:42,582 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 154 transitions. [2018-11-10 08:00:42,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 154 transitions. [2018-11-10 08:00:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 08:00:42,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,583 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:42,583 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,583 INFO L82 PathProgramCache]: Analyzing trace with hash 376359104, now seen corresponding path program 1 times [2018-11-10 08:00:42,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,621 INFO L87 Difference]: Start difference. First operand 88 states and 154 transitions. Second operand 3 states. [2018-11-10 08:00:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:42,632 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2018-11-10 08:00:42,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:42,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 08:00:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:42,633 INFO L225 Difference]: With dead ends: 165 [2018-11-10 08:00:42,633 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 08:00:42,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 08:00:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2018-11-10 08:00:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 08:00:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 203 transitions. [2018-11-10 08:00:42,641 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 203 transitions. Word has length 24 [2018-11-10 08:00:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:42,641 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 203 transitions. [2018-11-10 08:00:42,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 203 transitions. [2018-11-10 08:00:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 08:00:42,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,642 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:42,643 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash -903504574, now seen corresponding path program 1 times [2018-11-10 08:00:42,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,678 INFO L87 Difference]: Start difference. First operand 115 states and 203 transitions. Second operand 3 states. [2018-11-10 08:00:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:42,697 INFO L93 Difference]: Finished difference Result 271 states and 485 transitions. [2018-11-10 08:00:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:42,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 08:00:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:42,698 INFO L225 Difference]: With dead ends: 271 [2018-11-10 08:00:42,698 INFO L226 Difference]: Without dead ends: 165 [2018-11-10 08:00:42,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-10 08:00:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-11-10 08:00:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-10 08:00:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 287 transitions. [2018-11-10 08:00:42,707 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 287 transitions. Word has length 24 [2018-11-10 08:00:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:42,707 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 287 transitions. [2018-11-10 08:00:42,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 287 transitions. [2018-11-10 08:00:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 08:00:42,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,708 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:42,708 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1217556590, now seen corresponding path program 1 times [2018-11-10 08:00:42,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,739 INFO L87 Difference]: Start difference. First operand 163 states and 287 transitions. Second operand 3 states. [2018-11-10 08:00:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:42,751 INFO L93 Difference]: Finished difference Result 244 states and 428 transitions. [2018-11-10 08:00:42,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:42,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 08:00:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:42,752 INFO L225 Difference]: With dead ends: 244 [2018-11-10 08:00:42,752 INFO L226 Difference]: Without dead ends: 167 [2018-11-10 08:00:42,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-10 08:00:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-10 08:00:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-10 08:00:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 287 transitions. [2018-11-10 08:00:42,760 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 287 transitions. Word has length 25 [2018-11-10 08:00:42,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:42,760 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 287 transitions. [2018-11-10 08:00:42,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:42,760 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2018-11-10 08:00:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 08:00:42,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,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] [2018-11-10 08:00:42,762 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2056342352, now seen corresponding path program 1 times [2018-11-10 08:00:42,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,793 INFO L87 Difference]: Start difference. First operand 165 states and 287 transitions. Second operand 3 states. [2018-11-10 08:00:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:42,806 INFO L93 Difference]: Finished difference Result 309 states and 545 transitions. [2018-11-10 08:00:42,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:42,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 08:00:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:42,808 INFO L225 Difference]: With dead ends: 309 [2018-11-10 08:00:42,808 INFO L226 Difference]: Without dead ends: 307 [2018-11-10 08:00:42,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-10 08:00:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 221. [2018-11-10 08:00:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-10 08:00:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 383 transitions. [2018-11-10 08:00:42,817 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 383 transitions. Word has length 25 [2018-11-10 08:00:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:42,817 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 383 transitions. [2018-11-10 08:00:42,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 383 transitions. [2018-11-10 08:00:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 08:00:42,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,819 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:42,819 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,819 INFO L82 PathProgramCache]: Analyzing trace with hash 776478674, now seen corresponding path program 1 times [2018-11-10 08:00:42,819 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,857 INFO L87 Difference]: Start difference. First operand 221 states and 383 transitions. Second operand 3 states. [2018-11-10 08:00:42,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:42,891 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2018-11-10 08:00:42,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:42,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 08:00:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:42,894 INFO L225 Difference]: With dead ends: 525 [2018-11-10 08:00:42,894 INFO L226 Difference]: Without dead ends: 315 [2018-11-10 08:00:42,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-10 08:00:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-11-10 08:00:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-10 08:00:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 539 transitions. [2018-11-10 08:00:42,905 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 539 transitions. Word has length 25 [2018-11-10 08:00:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:42,905 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 539 transitions. [2018-11-10 08:00:42,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:42,906 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 539 transitions. [2018-11-10 08:00:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 08:00:42,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,907 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:42,907 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,907 INFO L82 PathProgramCache]: Analyzing trace with hash -677683113, now seen corresponding path program 1 times [2018-11-10 08:00:42,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,926 INFO L87 Difference]: Start difference. First operand 313 states and 539 transitions. Second operand 3 states. [2018-11-10 08:00:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:42,942 INFO L93 Difference]: Finished difference Result 469 states and 805 transitions. [2018-11-10 08:00:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:42,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 08:00:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:42,944 INFO L225 Difference]: With dead ends: 469 [2018-11-10 08:00:42,944 INFO L226 Difference]: Without dead ends: 319 [2018-11-10 08:00:42,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-10 08:00:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-11-10 08:00:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-10 08:00:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 539 transitions. [2018-11-10 08:00:42,955 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 539 transitions. Word has length 26 [2018-11-10 08:00:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:42,955 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 539 transitions. [2018-11-10 08:00:42,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 539 transitions. [2018-11-10 08:00:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 08:00:42,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:42,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:42,957 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:42,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:42,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1698751467, now seen corresponding path program 1 times [2018-11-10 08:00:42,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:42,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:42,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:42,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:42,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:42,982 INFO L87 Difference]: Start difference. First operand 317 states and 539 transitions. Second operand 3 states. [2018-11-10 08:00:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,001 INFO L93 Difference]: Finished difference Result 589 states and 1017 transitions. [2018-11-10 08:00:43,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 08:00:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,004 INFO L225 Difference]: With dead ends: 589 [2018-11-10 08:00:43,004 INFO L226 Difference]: Without dead ends: 587 [2018-11-10 08:00:43,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-10 08:00:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2018-11-10 08:00:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-10 08:00:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 727 transitions. [2018-11-10 08:00:43,018 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 727 transitions. Word has length 26 [2018-11-10 08:00:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,018 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 727 transitions. [2018-11-10 08:00:43,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 727 transitions. [2018-11-10 08:00:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 08:00:43,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,020 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1316352151, now seen corresponding path program 1 times [2018-11-10 08:00:43,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,057 INFO L87 Difference]: Start difference. First operand 433 states and 727 transitions. Second operand 3 states. [2018-11-10 08:00:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,079 INFO L93 Difference]: Finished difference Result 1029 states and 1737 transitions. [2018-11-10 08:00:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 08:00:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,081 INFO L225 Difference]: With dead ends: 1029 [2018-11-10 08:00:43,081 INFO L226 Difference]: Without dead ends: 611 [2018-11-10 08:00:43,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-10 08:00:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2018-11-10 08:00:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-10 08:00:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1015 transitions. [2018-11-10 08:00:43,095 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1015 transitions. Word has length 26 [2018-11-10 08:00:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,095 INFO L481 AbstractCegarLoop]: Abstraction has 609 states and 1015 transitions. [2018-11-10 08:00:43,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1015 transitions. [2018-11-10 08:00:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 08:00:43,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,096 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,097 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1121474169, now seen corresponding path program 1 times [2018-11-10 08:00:43,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,121 INFO L87 Difference]: Start difference. First operand 609 states and 1015 transitions. Second operand 3 states. [2018-11-10 08:00:43,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,147 INFO L93 Difference]: Finished difference Result 913 states and 1517 transitions. [2018-11-10 08:00:43,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 08:00:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,149 INFO L225 Difference]: With dead ends: 913 [2018-11-10 08:00:43,149 INFO L226 Difference]: Without dead ends: 619 [2018-11-10 08:00:43,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-10 08:00:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-11-10 08:00:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-10 08:00:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1015 transitions. [2018-11-10 08:00:43,160 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1015 transitions. Word has length 27 [2018-11-10 08:00:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,160 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 1015 transitions. [2018-11-10 08:00:43,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1015 transitions. [2018-11-10 08:00:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 08:00:43,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,162 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,162 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2142542523, now seen corresponding path program 1 times [2018-11-10 08:00:43,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,180 INFO L87 Difference]: Start difference. First operand 617 states and 1015 transitions. Second operand 3 states. [2018-11-10 08:00:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,200 INFO L93 Difference]: Finished difference Result 1789 states and 2937 transitions. [2018-11-10 08:00:43,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 08:00:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,203 INFO L225 Difference]: With dead ends: 1789 [2018-11-10 08:00:43,203 INFO L226 Difference]: Without dead ends: 1195 [2018-11-10 08:00:43,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-11-10 08:00:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1193. [2018-11-10 08:00:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-10 08:00:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1927 transitions. [2018-11-10 08:00:43,226 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1927 transitions. Word has length 27 [2018-11-10 08:00:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,226 INFO L481 AbstractCegarLoop]: Abstraction has 1193 states and 1927 transitions. [2018-11-10 08:00:43,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1927 transitions. [2018-11-10 08:00:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 08:00:43,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,228 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,228 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,228 INFO L82 PathProgramCache]: Analyzing trace with hash -862678845, now seen corresponding path program 1 times [2018-11-10 08:00:43,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,256 INFO L87 Difference]: Start difference. First operand 1193 states and 1927 transitions. Second operand 3 states. [2018-11-10 08:00:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,291 INFO L93 Difference]: Finished difference Result 1469 states and 2425 transitions. [2018-11-10 08:00:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 08:00:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,294 INFO L225 Difference]: With dead ends: 1469 [2018-11-10 08:00:43,294 INFO L226 Difference]: Without dead ends: 1467 [2018-11-10 08:00:43,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-11-10 08:00:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1193. [2018-11-10 08:00:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-10 08:00:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1911 transitions. [2018-11-10 08:00:43,317 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1911 transitions. Word has length 27 [2018-11-10 08:00:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,317 INFO L481 AbstractCegarLoop]: Abstraction has 1193 states and 1911 transitions. [2018-11-10 08:00:43,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1911 transitions. [2018-11-10 08:00:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 08:00:43,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,319 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1994094676, now seen corresponding path program 1 times [2018-11-10 08:00:43,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,344 INFO L87 Difference]: Start difference. First operand 1193 states and 1911 transitions. Second operand 3 states. [2018-11-10 08:00:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,373 INFO L93 Difference]: Finished difference Result 2173 states and 3545 transitions. [2018-11-10 08:00:43,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 08:00:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,378 INFO L225 Difference]: With dead ends: 2173 [2018-11-10 08:00:43,378 INFO L226 Difference]: Without dead ends: 2171 [2018-11-10 08:00:43,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2018-11-10 08:00:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1689. [2018-11-10 08:00:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2018-11-10 08:00:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2647 transitions. [2018-11-10 08:00:43,408 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2647 transitions. Word has length 28 [2018-11-10 08:00:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,408 INFO L481 AbstractCegarLoop]: Abstraction has 1689 states and 2647 transitions. [2018-11-10 08:00:43,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2647 transitions. [2018-11-10 08:00:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 08:00:43,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,411 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1021008942, now seen corresponding path program 1 times [2018-11-10 08:00:43,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,436 INFO L87 Difference]: Start difference. First operand 1689 states and 2647 transitions. Second operand 3 states. [2018-11-10 08:00:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,468 INFO L93 Difference]: Finished difference Result 3997 states and 6297 transitions. [2018-11-10 08:00:43,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 08:00:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,473 INFO L225 Difference]: With dead ends: 3997 [2018-11-10 08:00:43,473 INFO L226 Difference]: Without dead ends: 2331 [2018-11-10 08:00:43,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2018-11-10 08:00:43,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2329. [2018-11-10 08:00:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2329 states. [2018-11-10 08:00:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3623 transitions. [2018-11-10 08:00:43,514 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3623 transitions. Word has length 28 [2018-11-10 08:00:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,514 INFO L481 AbstractCegarLoop]: Abstraction has 2329 states and 3623 transitions. [2018-11-10 08:00:43,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3623 transitions. [2018-11-10 08:00:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 08:00:43,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,517 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1687178374, now seen corresponding path program 1 times [2018-11-10 08:00:43,517 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,530 INFO L87 Difference]: Start difference. First operand 2329 states and 3623 transitions. Second operand 3 states. [2018-11-10 08:00:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,573 INFO L93 Difference]: Finished difference Result 3517 states and 5465 transitions. [2018-11-10 08:00:43,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 08:00:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,577 INFO L225 Difference]: With dead ends: 3517 [2018-11-10 08:00:43,577 INFO L226 Difference]: Without dead ends: 2379 [2018-11-10 08:00:43,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2018-11-10 08:00:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2377. [2018-11-10 08:00:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-10 08:00:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3655 transitions. [2018-11-10 08:00:43,646 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3655 transitions. Word has length 29 [2018-11-10 08:00:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,646 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 3655 transitions. [2018-11-10 08:00:43,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3655 transitions. [2018-11-10 08:00:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 08:00:43,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,648 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,648 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1586720568, now seen corresponding path program 1 times [2018-11-10 08:00:43,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,661 INFO L87 Difference]: Start difference. First operand 2377 states and 3655 transitions. Second operand 3 states. [2018-11-10 08:00:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,707 INFO L93 Difference]: Finished difference Result 4237 states and 6633 transitions. [2018-11-10 08:00:43,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 08:00:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,714 INFO L225 Difference]: With dead ends: 4237 [2018-11-10 08:00:43,714 INFO L226 Difference]: Without dead ends: 4235 [2018-11-10 08:00:43,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-11-10 08:00:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3401. [2018-11-10 08:00:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2018-11-10 08:00:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 5095 transitions. [2018-11-10 08:00:43,765 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 5095 transitions. Word has length 29 [2018-11-10 08:00:43,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,765 INFO L481 AbstractCegarLoop]: Abstraction has 3401 states and 5095 transitions. [2018-11-10 08:00:43,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 5095 transitions. [2018-11-10 08:00:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 08:00:43,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,768 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,769 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash 306856890, now seen corresponding path program 1 times [2018-11-10 08:00:43,769 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,788 INFO L87 Difference]: Start difference. First operand 3401 states and 5095 transitions. Second operand 3 states. [2018-11-10 08:00:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:43,845 INFO L93 Difference]: Finished difference Result 7949 states and 11945 transitions. [2018-11-10 08:00:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:43,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 08:00:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:43,854 INFO L225 Difference]: With dead ends: 7949 [2018-11-10 08:00:43,854 INFO L226 Difference]: Without dead ends: 4619 [2018-11-10 08:00:43,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-10 08:00:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4617. [2018-11-10 08:00:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4617 states. [2018-11-10 08:00:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 6855 transitions. [2018-11-10 08:00:43,931 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 6855 transitions. Word has length 29 [2018-11-10 08:00:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:43,931 INFO L481 AbstractCegarLoop]: Abstraction has 4617 states and 6855 transitions. [2018-11-10 08:00:43,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 6855 transitions. [2018-11-10 08:00:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 08:00:43,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:43,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:43,934 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:43,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:43,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1943912131, now seen corresponding path program 1 times [2018-11-10 08:00:43,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:43,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:43,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:43,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:43,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:43,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:43,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:43,952 INFO L87 Difference]: Start difference. First operand 4617 states and 6855 transitions. Second operand 3 states. [2018-11-10 08:00:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:44,006 INFO L93 Difference]: Finished difference Result 6925 states and 10249 transitions. [2018-11-10 08:00:44,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:44,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 08:00:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:44,018 INFO L225 Difference]: With dead ends: 6925 [2018-11-10 08:00:44,018 INFO L226 Difference]: Without dead ends: 4683 [2018-11-10 08:00:44,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:44,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2018-11-10 08:00:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4681. [2018-11-10 08:00:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2018-11-10 08:00:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 6855 transitions. [2018-11-10 08:00:44,095 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 6855 transitions. Word has length 30 [2018-11-10 08:00:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:44,096 INFO L481 AbstractCegarLoop]: Abstraction has 4681 states and 6855 transitions. [2018-11-10 08:00:44,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 6855 transitions. [2018-11-10 08:00:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 08:00:44,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:44,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:44,099 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:44,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:44,099 INFO L82 PathProgramCache]: Analyzing trace with hash 922843777, now seen corresponding path program 1 times [2018-11-10 08:00:44,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:44,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:44,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:44,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:44,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:44,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:44,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:44,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:44,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:44,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:44,124 INFO L87 Difference]: Start difference. First operand 4681 states and 6855 transitions. Second operand 3 states. [2018-11-10 08:00:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:44,200 INFO L93 Difference]: Finished difference Result 8205 states and 12233 transitions. [2018-11-10 08:00:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:44,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 08:00:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:44,212 INFO L225 Difference]: With dead ends: 8205 [2018-11-10 08:00:44,212 INFO L226 Difference]: Without dead ends: 8203 [2018-11-10 08:00:44,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2018-11-10 08:00:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 6793. [2018-11-10 08:00:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-11-10 08:00:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9671 transitions. [2018-11-10 08:00:44,318 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9671 transitions. Word has length 30 [2018-11-10 08:00:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:44,318 INFO L481 AbstractCegarLoop]: Abstraction has 6793 states and 9671 transitions. [2018-11-10 08:00:44,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9671 transitions. [2018-11-10 08:00:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 08:00:44,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:44,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:44,324 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:44,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:44,324 INFO L82 PathProgramCache]: Analyzing trace with hash -357019901, now seen corresponding path program 1 times [2018-11-10 08:00:44,325 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:44,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:44,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:44,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:44,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:44,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:44,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:44,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:44,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:44,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:44,344 INFO L87 Difference]: Start difference. First operand 6793 states and 9671 transitions. Second operand 3 states. [2018-11-10 08:00:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:44,463 INFO L93 Difference]: Finished difference Result 15757 states and 22473 transitions. [2018-11-10 08:00:44,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:44,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 08:00:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:44,474 INFO L225 Difference]: With dead ends: 15757 [2018-11-10 08:00:44,474 INFO L226 Difference]: Without dead ends: 9099 [2018-11-10 08:00:44,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2018-11-10 08:00:44,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 9097. [2018-11-10 08:00:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9097 states. [2018-11-10 08:00:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9097 states to 9097 states and 12807 transitions. [2018-11-10 08:00:44,639 INFO L78 Accepts]: Start accepts. Automaton has 9097 states and 12807 transitions. Word has length 30 [2018-11-10 08:00:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:44,640 INFO L481 AbstractCegarLoop]: Abstraction has 9097 states and 12807 transitions. [2018-11-10 08:00:44,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 9097 states and 12807 transitions. [2018-11-10 08:00:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 08:00:44,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:44,644 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:44,645 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:44,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:44,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1456398865, now seen corresponding path program 1 times [2018-11-10 08:00:44,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:44,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:44,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:44,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:44,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:44,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:44,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:44,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:44,668 INFO L87 Difference]: Start difference. First operand 9097 states and 12807 transitions. Second operand 3 states. [2018-11-10 08:00:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:44,765 INFO L93 Difference]: Finished difference Result 13645 states and 19145 transitions. [2018-11-10 08:00:44,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:44,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 08:00:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:44,775 INFO L225 Difference]: With dead ends: 13645 [2018-11-10 08:00:44,775 INFO L226 Difference]: Without dead ends: 9227 [2018-11-10 08:00:44,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2018-11-10 08:00:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 9225. [2018-11-10 08:00:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2018-11-10 08:00:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 12807 transitions. [2018-11-10 08:00:44,920 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 12807 transitions. Word has length 31 [2018-11-10 08:00:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:44,921 INFO L481 AbstractCegarLoop]: Abstraction has 9225 states and 12807 transitions. [2018-11-10 08:00:44,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 12807 transitions. [2018-11-10 08:00:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 08:00:44,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:44,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] [2018-11-10 08:00:44,926 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:44,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1817500077, now seen corresponding path program 1 times [2018-11-10 08:00:44,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:44,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:44,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:44,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-10 08:00:44,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:44,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:44,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:44,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:44,948 INFO L87 Difference]: Start difference. First operand 9225 states and 12807 transitions. Second operand 3 states. [2018-11-10 08:00:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:45,095 INFO L93 Difference]: Finished difference Result 15885 states and 22409 transitions. [2018-11-10 08:00:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:45,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 08:00:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:45,112 INFO L225 Difference]: With dead ends: 15885 [2018-11-10 08:00:45,112 INFO L226 Difference]: Without dead ends: 15883 [2018-11-10 08:00:45,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2018-11-10 08:00:45,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 13577. [2018-11-10 08:00:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13577 states. [2018-11-10 08:00:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 18311 transitions. [2018-11-10 08:00:45,323 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 18311 transitions. Word has length 31 [2018-11-10 08:00:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:45,323 INFO L481 AbstractCegarLoop]: Abstraction has 13577 states and 18311 transitions. [2018-11-10 08:00:45,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 18311 transitions. [2018-11-10 08:00:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 08:00:45,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:45,333 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:45,333 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:45,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash 537636399, now seen corresponding path program 1 times [2018-11-10 08:00:45,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:45,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:45,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:45,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:45,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:45,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:45,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:45,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:45,357 INFO L87 Difference]: Start difference. First operand 13577 states and 18311 transitions. Second operand 3 states. [2018-11-10 08:00:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:45,557 INFO L93 Difference]: Finished difference Result 31245 states and 42121 transitions. [2018-11-10 08:00:45,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:45,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 08:00:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:45,575 INFO L225 Difference]: With dead ends: 31245 [2018-11-10 08:00:45,575 INFO L226 Difference]: Without dead ends: 17931 [2018-11-10 08:00:45,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17931 states. [2018-11-10 08:00:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17931 to 17929. [2018-11-10 08:00:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17929 states. [2018-11-10 08:00:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 23815 transitions. [2018-11-10 08:00:45,828 INFO L78 Accepts]: Start accepts. Automaton has 17929 states and 23815 transitions. Word has length 31 [2018-11-10 08:00:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:45,828 INFO L481 AbstractCegarLoop]: Abstraction has 17929 states and 23815 transitions. [2018-11-10 08:00:45,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17929 states and 23815 transitions. [2018-11-10 08:00:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 08:00:45,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:45,837 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:45,837 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:45,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash 508143000, now seen corresponding path program 1 times [2018-11-10 08:00:45,837 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:45,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:45,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:45,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:45,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:45,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:45,856 INFO L87 Difference]: Start difference. First operand 17929 states and 23815 transitions. Second operand 3 states. [2018-11-10 08:00:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:46,018 INFO L93 Difference]: Finished difference Result 26893 states and 35593 transitions. [2018-11-10 08:00:46,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:46,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 08:00:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:46,036 INFO L225 Difference]: With dead ends: 26893 [2018-11-10 08:00:46,036 INFO L226 Difference]: Without dead ends: 18187 [2018-11-10 08:00:46,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18187 states. [2018-11-10 08:00:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18187 to 18185. [2018-11-10 08:00:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18185 states. [2018-11-10 08:00:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18185 states to 18185 states and 23815 transitions. [2018-11-10 08:00:46,305 INFO L78 Accepts]: Start accepts. Automaton has 18185 states and 23815 transitions. Word has length 32 [2018-11-10 08:00:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:46,305 INFO L481 AbstractCegarLoop]: Abstraction has 18185 states and 23815 transitions. [2018-11-10 08:00:46,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 18185 states and 23815 transitions. [2018-11-10 08:00:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 08:00:46,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:46,314 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:46,315 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:46,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:46,315 INFO L82 PathProgramCache]: Analyzing trace with hash -512925354, now seen corresponding path program 1 times [2018-11-10 08:00:46,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:46,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:46,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:46,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:46,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:46,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:46,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:46,332 INFO L87 Difference]: Start difference. First operand 18185 states and 23815 transitions. Second operand 3 states. [2018-11-10 08:00:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:46,564 INFO L93 Difference]: Finished difference Result 30733 states and 40713 transitions. [2018-11-10 08:00:46,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:46,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 08:00:46,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:46,594 INFO L225 Difference]: With dead ends: 30733 [2018-11-10 08:00:46,595 INFO L226 Difference]: Without dead ends: 30731 [2018-11-10 08:00:46,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30731 states. [2018-11-10 08:00:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30731 to 27145. [2018-11-10 08:00:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27145 states. [2018-11-10 08:00:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27145 states to 27145 states and 34567 transitions. [2018-11-10 08:00:46,921 INFO L78 Accepts]: Start accepts. Automaton has 27145 states and 34567 transitions. Word has length 32 [2018-11-10 08:00:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:46,922 INFO L481 AbstractCegarLoop]: Abstraction has 27145 states and 34567 transitions. [2018-11-10 08:00:46,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 27145 states and 34567 transitions. [2018-11-10 08:00:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 08:00:46,939 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:46,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:46,940 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:46,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1792789032, now seen corresponding path program 1 times [2018-11-10 08:00:46,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:46,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:46,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:46,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:46,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:46,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:46,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:46,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:46,960 INFO L87 Difference]: Start difference. First operand 27145 states and 34567 transitions. Second operand 3 states. [2018-11-10 08:00:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:47,304 INFO L93 Difference]: Finished difference Result 61965 states and 78601 transitions. [2018-11-10 08:00:47,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:47,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 08:00:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:47,327 INFO L225 Difference]: With dead ends: 61965 [2018-11-10 08:00:47,327 INFO L226 Difference]: Without dead ends: 35339 [2018-11-10 08:00:47,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35339 states. [2018-11-10 08:00:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35339 to 35337. [2018-11-10 08:00:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35337 states. [2018-11-10 08:00:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35337 states to 35337 states and 44039 transitions. [2018-11-10 08:00:47,797 INFO L78 Accepts]: Start accepts. Automaton has 35337 states and 44039 transitions. Word has length 32 [2018-11-10 08:00:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:47,797 INFO L481 AbstractCegarLoop]: Abstraction has 35337 states and 44039 transitions. [2018-11-10 08:00:47,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 35337 states and 44039 transitions. [2018-11-10 08:00:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 08:00:47,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:47,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:47,808 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:47,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1279399012, now seen corresponding path program 1 times [2018-11-10 08:00:47,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:47,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:47,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:47,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:47,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:47,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:47,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:47,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:47,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:47,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:47,828 INFO L87 Difference]: Start difference. First operand 35337 states and 44039 transitions. Second operand 3 states. [2018-11-10 08:00:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:48,244 INFO L93 Difference]: Finished difference Result 53005 states and 65801 transitions. [2018-11-10 08:00:48,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:48,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 08:00:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:48,276 INFO L225 Difference]: With dead ends: 53005 [2018-11-10 08:00:48,276 INFO L226 Difference]: Without dead ends: 35851 [2018-11-10 08:00:48,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35851 states. [2018-11-10 08:00:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35851 to 35849. [2018-11-10 08:00:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35849 states. [2018-11-10 08:00:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35849 states to 35849 states and 44039 transitions. [2018-11-10 08:00:48,750 INFO L78 Accepts]: Start accepts. Automaton has 35849 states and 44039 transitions. Word has length 33 [2018-11-10 08:00:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:48,750 INFO L481 AbstractCegarLoop]: Abstraction has 35849 states and 44039 transitions. [2018-11-10 08:00:48,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 35849 states and 44039 transitions. [2018-11-10 08:00:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 08:00:48,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:48,759 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:48,759 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:48,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash 258330658, now seen corresponding path program 1 times [2018-11-10 08:00:48,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:48,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:48,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:48,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:48,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:48,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:48,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:48,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:48,785 INFO L87 Difference]: Start difference. First operand 35849 states and 44039 transitions. Second operand 3 states. [2018-11-10 08:00:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:49,397 INFO L93 Difference]: Finished difference Result 59405 states and 73225 transitions. [2018-11-10 08:00:49,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:49,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 08:00:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:49,430 INFO L225 Difference]: With dead ends: 59405 [2018-11-10 08:00:49,430 INFO L226 Difference]: Without dead ends: 59403 [2018-11-10 08:00:49,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59403 states. [2018-11-10 08:00:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59403 to 54281. [2018-11-10 08:00:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54281 states. [2018-11-10 08:00:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 65031 transitions. [2018-11-10 08:00:49,985 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 65031 transitions. Word has length 33 [2018-11-10 08:00:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:49,985 INFO L481 AbstractCegarLoop]: Abstraction has 54281 states and 65031 transitions. [2018-11-10 08:00:49,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 65031 transitions. [2018-11-10 08:00:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 08:00:50,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:50,011 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:50,011 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:50,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1021533020, now seen corresponding path program 1 times [2018-11-10 08:00:50,012 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:50,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:50,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:50,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:50,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:50,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:50,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:50,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:50,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:50,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:50,037 INFO L87 Difference]: Start difference. First operand 54281 states and 65031 transitions. Second operand 3 states. [2018-11-10 08:00:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:50,773 INFO L93 Difference]: Finished difference Result 122893 states and 145929 transitions. [2018-11-10 08:00:50,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:50,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 08:00:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:50,813 INFO L225 Difference]: With dead ends: 122893 [2018-11-10 08:00:50,813 INFO L226 Difference]: Without dead ends: 69643 [2018-11-10 08:00:50,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69643 states. [2018-11-10 08:00:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69643 to 69641. [2018-11-10 08:00:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69641 states. [2018-11-10 08:00:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69641 states to 69641 states and 80903 transitions. [2018-11-10 08:00:51,742 INFO L78 Accepts]: Start accepts. Automaton has 69641 states and 80903 transitions. Word has length 33 [2018-11-10 08:00:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:51,742 INFO L481 AbstractCegarLoop]: Abstraction has 69641 states and 80903 transitions. [2018-11-10 08:00:51,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 69641 states and 80903 transitions. [2018-11-10 08:00:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 08:00:51,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:51,763 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:51,764 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:51,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash -581468051, now seen corresponding path program 1 times [2018-11-10 08:00:51,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:51,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:51,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:51,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:51,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:51,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:51,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:51,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:51,794 INFO L87 Difference]: Start difference. First operand 69641 states and 80903 transitions. Second operand 3 states. [2018-11-10 08:00:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:52,598 INFO L93 Difference]: Finished difference Result 104461 states and 120841 transitions. [2018-11-10 08:00:52,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:52,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 08:00:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:52,647 INFO L225 Difference]: With dead ends: 104461 [2018-11-10 08:00:52,647 INFO L226 Difference]: Without dead ends: 70667 [2018-11-10 08:00:52,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70667 states. [2018-11-10 08:00:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70667 to 70665. [2018-11-10 08:00:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70665 states. [2018-11-10 08:00:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70665 states to 70665 states and 80903 transitions. [2018-11-10 08:00:53,574 INFO L78 Accepts]: Start accepts. Automaton has 70665 states and 80903 transitions. Word has length 34 [2018-11-10 08:00:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:53,575 INFO L481 AbstractCegarLoop]: Abstraction has 70665 states and 80903 transitions. [2018-11-10 08:00:53,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 70665 states and 80903 transitions. [2018-11-10 08:00:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 08:00:53,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:53,596 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:53,596 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:53,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:53,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1602536405, now seen corresponding path program 1 times [2018-11-10 08:00:53,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:53,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:53,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:53,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:53,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:53,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:53,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:53,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:53,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:53,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:53,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:53,632 INFO L87 Difference]: Start difference. First operand 70665 states and 80903 transitions. Second operand 3 states. [2018-11-10 08:00:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:54,849 INFO L93 Difference]: Finished difference Result 114699 states and 130056 transitions. [2018-11-10 08:00:54,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:54,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 08:00:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:54,918 INFO L225 Difference]: With dead ends: 114699 [2018-11-10 08:00:54,918 INFO L226 Difference]: Without dead ends: 114697 [2018-11-10 08:00:54,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114697 states. [2018-11-10 08:00:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114697 to 108553. [2018-11-10 08:00:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108553 states. [2018-11-10 08:00:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108553 states to 108553 states and 121863 transitions. [2018-11-10 08:00:56,089 INFO L78 Accepts]: Start accepts. Automaton has 108553 states and 121863 transitions. Word has length 34 [2018-11-10 08:00:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:56,090 INFO L481 AbstractCegarLoop]: Abstraction has 108553 states and 121863 transitions. [2018-11-10 08:00:56,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 108553 states and 121863 transitions. [2018-11-10 08:00:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 08:00:56,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:00:56,146 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:00:56,146 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:00:56,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:00:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1412567213, now seen corresponding path program 1 times [2018-11-10 08:00:56,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:00:56,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:00:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:56,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:00:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:00:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:00:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:00:56,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:00:56,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:00:56,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:00:56,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:00:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:56,173 INFO L87 Difference]: Start difference. First operand 108553 states and 121863 transitions. Second operand 3 states. [2018-11-10 08:00:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:00:57,706 INFO L93 Difference]: Finished difference Result 243721 states and 269319 transitions. [2018-11-10 08:00:57,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:00:57,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 08:00:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:00:57,707 INFO L225 Difference]: With dead ends: 243721 [2018-11-10 08:00:57,707 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 08:00:57,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:00:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 08:00:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 08:00:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 08:00:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 08:00:57,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-10 08:00:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:00:57,797 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:00:57,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:00:57,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:00:57,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 08:00:57,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 08:00:57,832 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 08:00:57,833 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:00:57,833 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:00:57,833 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 08:00:57,833 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 08:00:57,833 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 08:00:57,833 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,833 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-11-10 08:00:57,833 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-11-10 08:00:57,833 INFO L425 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,833 INFO L425 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,833 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,834 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-11-10 08:00:57,834 INFO L428 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L428 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 08:00:57,835 INFO L425 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L421 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-11-10 08:00:57,836 INFO L425 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-11-10 08:00:57,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:00:57 BoogieIcfgContainer [2018-11-10 08:00:57,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:00:57,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:00:57,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:00:57,849 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:00:57,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:00:42" (3/4) ... [2018-11-10 08:00:57,852 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 08:00:57,857 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 08:00:57,857 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 08:00:57,861 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 08:00:57,862 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 08:00:57,862 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 08:00:57,904 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_60fda515-e738-4456-8cac-c8a9d9c11de1/bin-2019/uautomizer/witness.graphml [2018-11-10 08:00:57,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:00:57,905 INFO L168 Benchmark]: Toolchain (without parser) took 16261.18 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 959.2 MB in the beginning and 1.2 GB in the end (delta: -263.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 08:00:57,906 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:00:57,907 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.79 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 08:00:57,907 INFO L168 Benchmark]: Boogie Preprocessor took 22.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:00:57,907 INFO L168 Benchmark]: RCFGBuilder took 266.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:00:57,907 INFO L168 Benchmark]: TraceAbstraction took 15751.19 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 08:00:57,908 INFO L168 Benchmark]: Witness Printer took 56.28 ms. Allocated memory is still 2.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 859.8 kB). Peak memory consumption was 859.8 kB. Max. memory is 11.5 GB. [2018-11-10 08:00:57,909 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.79 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 266.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15751.19 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 56.28 ms. Allocated memory is still 2.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 859.8 kB). Peak memory consumption was 859.8 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. SAFE Result, 15.6s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3487 SDtfs, 1713 SDslu, 2374 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108553occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 20515 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 941 ConstructedInterpolants, 0 QuantifiedInterpolants, 53057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...