java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:07:25,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:07:25,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:07:25,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:07:25,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:07:25,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:07:25,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:07:25,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:07:25,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:07:25,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:07:25,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:07:25,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:07:25,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:07:25,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:07:25,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:07:25,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:07:25,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:07:25,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:07:25,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:07:25,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:07:25,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:07:25,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:07:25,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:07:25,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:07:25,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:07:25,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:07:25,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:07:25,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:07:25,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:07:25,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:07:25,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:07:25,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:07:25,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:07:25,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:07:25,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:07:25,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:07:25,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:07:25,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:07:25,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:07:25,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:07:25,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:07:25,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:07:25,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:07:25,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:07:25,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:07:25,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:07:25,428 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:07:25,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:07:25,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:07:25,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:07:25,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:07:25,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:07:25,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:07:25,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:07:25,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:07:25,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:07:25,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:07:25,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:07:25,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:07:25,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:07:25,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:07:25,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:07:25,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:07:25,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:07:25,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:07:25,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:07:25,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:07:25,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:07:25,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:07:25,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:07:25,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:07:25,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:07:25,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:07:25,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:07:25,496 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:07:25,497 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:07:25,497 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:07:25,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07877add3/baefc71d0cf84bbeb0e1ded1b6053f77/FLAGc8fa9ee1e [2019-09-08 10:07:26,234 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:07:26,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:07:26,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07877add3/baefc71d0cf84bbeb0e1ded1b6053f77/FLAGc8fa9ee1e [2019-09-08 10:07:26,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07877add3/baefc71d0cf84bbeb0e1ded1b6053f77 [2019-09-08 10:07:26,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:07:26,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:07:26,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:07:26,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:07:26,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:07:26,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:07:26" (1/1) ... [2019-09-08 10:07:26,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262753be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:26, skipping insertion in model container [2019-09-08 10:07:26,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:07:26" (1/1) ... [2019-09-08 10:07:26,426 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:07:26,596 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:07:27,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:07:27,937 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:07:29,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:07:29,470 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:07:29,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29 WrapperNode [2019-09-08 10:07:29,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:07:29,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:07:29,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:07:29,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:07:29,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29" (1/1) ... [2019-09-08 10:07:29,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29" (1/1) ... [2019-09-08 10:07:29,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29" (1/1) ... [2019-09-08 10:07:29,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29" (1/1) ... [2019-09-08 10:07:29,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29" (1/1) ... [2019-09-08 10:07:29,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29" (1/1) ... [2019-09-08 10:07:29,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29" (1/1) ... [2019-09-08 10:07:29,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:07:29,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:07:29,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:07:29,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:07:29,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:07:29,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:07:29,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:07:29,821 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:07:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:07:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:07:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:07:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:07:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:07:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:07:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:07:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:07:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:07:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:07:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:07:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:07:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:07:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:07:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:07:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:07:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:07:33,589 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:07:33,589 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:07:33,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:07:33 BoogieIcfgContainer [2019-09-08 10:07:33,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:07:33,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:07:33,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:07:33,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:07:33,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:07:26" (1/3) ... [2019-09-08 10:07:33,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357275c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:07:33, skipping insertion in model container [2019-09-08 10:07:33,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:07:29" (2/3) ... [2019-09-08 10:07:33,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357275c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:07:33, skipping insertion in model container [2019-09-08 10:07:33,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:07:33" (3/3) ... [2019-09-08 10:07:33,600 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:07:33,610 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:07:33,620 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:07:33,638 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:07:33,680 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:07:33,681 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:07:33,681 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:07:33,681 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:07:33,681 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:07:33,681 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:07:33,681 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:07:33,682 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:07:33,682 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:07:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states. [2019-09-08 10:07:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 10:07:33,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:33,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:33,763 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:33,771 INFO L82 PathProgramCache]: Analyzing trace with hash 860174320, now seen corresponding path program 1 times [2019-09-08 10:07:33,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:33,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:33,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:35,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:35,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:35,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:35,678 INFO L87 Difference]: Start difference. First operand 1322 states. Second operand 3 states. [2019-09-08 10:07:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:36,215 INFO L93 Difference]: Finished difference Result 2212 states and 3947 transitions. [2019-09-08 10:07:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:36,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 467 [2019-09-08 10:07:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:36,276 INFO L225 Difference]: With dead ends: 2212 [2019-09-08 10:07:36,276 INFO L226 Difference]: Without dead ends: 1956 [2019-09-08 10:07:36,283 INFO L628 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 [2019-09-08 10:07:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-09-08 10:07:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1954. [2019-09-08 10:07:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-09-08 10:07:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 3183 transitions. [2019-09-08 10:07:36,452 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 3183 transitions. Word has length 467 [2019-09-08 10:07:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:36,454 INFO L475 AbstractCegarLoop]: Abstraction has 1954 states and 3183 transitions. [2019-09-08 10:07:36,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 3183 transitions. [2019-09-08 10:07:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-09-08 10:07:36,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:36,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:36,467 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash -176279345, now seen corresponding path program 1 times [2019-09-08 10:07:36,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:36,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:38,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:38,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:07:38,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:07:38,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:07:38,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:38,401 INFO L87 Difference]: Start difference. First operand 1954 states and 3183 transitions. Second operand 4 states. [2019-09-08 10:07:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:38,734 INFO L93 Difference]: Finished difference Result 5793 states and 9438 transitions. [2019-09-08 10:07:38,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:07:38,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 467 [2019-09-08 10:07:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:38,757 INFO L225 Difference]: With dead ends: 5793 [2019-09-08 10:07:38,757 INFO L226 Difference]: Without dead ends: 3856 [2019-09-08 10:07:38,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:07:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2019-09-08 10:07:38,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 3854. [2019-09-08 10:07:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3854 states. [2019-09-08 10:07:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3854 states to 3854 states and 6254 transitions. [2019-09-08 10:07:38,952 INFO L78 Accepts]: Start accepts. Automaton has 3854 states and 6254 transitions. Word has length 467 [2019-09-08 10:07:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:38,953 INFO L475 AbstractCegarLoop]: Abstraction has 3854 states and 6254 transitions. [2019-09-08 10:07:38,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:07:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3854 states and 6254 transitions. [2019-09-08 10:07:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-09-08 10:07:38,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:38,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:38,969 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:38,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1050032589, now seen corresponding path program 1 times [2019-09-08 10:07:38,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:38,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:38,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:38,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:39,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:39,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:39,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:39,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:39,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:39,753 INFO L87 Difference]: Start difference. First operand 3854 states and 6254 transitions. Second operand 3 states. [2019-09-08 10:07:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:40,343 INFO L93 Difference]: Finished difference Result 11260 states and 18231 transitions. [2019-09-08 10:07:40,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:40,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 469 [2019-09-08 10:07:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:40,393 INFO L225 Difference]: With dead ends: 11260 [2019-09-08 10:07:40,394 INFO L226 Difference]: Without dead ends: 7620 [2019-09-08 10:07:40,418 INFO L628 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 [2019-09-08 10:07:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2019-09-08 10:07:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 7618. [2019-09-08 10:07:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7618 states. [2019-09-08 10:07:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7618 states to 7618 states and 12321 transitions. [2019-09-08 10:07:40,853 INFO L78 Accepts]: Start accepts. Automaton has 7618 states and 12321 transitions. Word has length 469 [2019-09-08 10:07:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:40,853 INFO L475 AbstractCegarLoop]: Abstraction has 7618 states and 12321 transitions. [2019-09-08 10:07:40,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 7618 states and 12321 transitions. [2019-09-08 10:07:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-09-08 10:07:40,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:40,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:40,880 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:40,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:40,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1709212756, now seen corresponding path program 1 times [2019-09-08 10:07:40,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:40,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:40,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:41,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:41,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:41,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:41,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:41,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:41,286 INFO L87 Difference]: Start difference. First operand 7618 states and 12321 transitions. Second operand 3 states. [2019-09-08 10:07:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:41,908 INFO L93 Difference]: Finished difference Result 22757 states and 36795 transitions. [2019-09-08 10:07:41,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:41,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 470 [2019-09-08 10:07:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:41,994 INFO L225 Difference]: With dead ends: 22757 [2019-09-08 10:07:41,994 INFO L226 Difference]: Without dead ends: 15191 [2019-09-08 10:07:42,015 INFO L628 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 [2019-09-08 10:07:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15191 states. [2019-09-08 10:07:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15191 to 7665. [2019-09-08 10:07:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7665 states. [2019-09-08 10:07:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7665 states to 7665 states and 12395 transitions. [2019-09-08 10:07:43,245 INFO L78 Accepts]: Start accepts. Automaton has 7665 states and 12395 transitions. Word has length 470 [2019-09-08 10:07:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:43,245 INFO L475 AbstractCegarLoop]: Abstraction has 7665 states and 12395 transitions. [2019-09-08 10:07:43,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7665 states and 12395 transitions. [2019-09-08 10:07:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-09-08 10:07:43,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:43,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:43,272 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:43,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:43,273 INFO L82 PathProgramCache]: Analyzing trace with hash 867417848, now seen corresponding path program 1 times [2019-09-08 10:07:43,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:43,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:43,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:43,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:43,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:43,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:43,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:43,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:43,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:43,871 INFO L87 Difference]: Start difference. First operand 7665 states and 12395 transitions. Second operand 3 states. [2019-09-08 10:07:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:44,573 INFO L93 Difference]: Finished difference Result 22272 states and 35912 transitions. [2019-09-08 10:07:44,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:44,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 471 [2019-09-08 10:07:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:44,615 INFO L225 Difference]: With dead ends: 22272 [2019-09-08 10:07:44,615 INFO L226 Difference]: Without dead ends: 15006 [2019-09-08 10:07:44,632 INFO L628 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 [2019-09-08 10:07:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15006 states. [2019-09-08 10:07:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15006 to 15004. [2019-09-08 10:07:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15004 states. [2019-09-08 10:07:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15004 states to 15004 states and 24145 transitions. [2019-09-08 10:07:45,295 INFO L78 Accepts]: Start accepts. Automaton has 15004 states and 24145 transitions. Word has length 471 [2019-09-08 10:07:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:45,296 INFO L475 AbstractCegarLoop]: Abstraction has 15004 states and 24145 transitions. [2019-09-08 10:07:45,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 15004 states and 24145 transitions. [2019-09-08 10:07:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-09-08 10:07:45,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:45,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:45,333 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash -563238701, now seen corresponding path program 1 times [2019-09-08 10:07:45,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:45,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:45,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:45,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:45,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:45,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:45,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:45,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:45,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:45,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:45,653 INFO L87 Difference]: Start difference. First operand 15004 states and 24145 transitions. Second operand 3 states. [2019-09-08 10:07:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:46,795 INFO L93 Difference]: Finished difference Result 44756 states and 71990 transitions. [2019-09-08 10:07:46,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:46,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 471 [2019-09-08 10:07:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:46,871 INFO L225 Difference]: With dead ends: 44756 [2019-09-08 10:07:46,871 INFO L226 Difference]: Without dead ends: 29896 [2019-09-08 10:07:46,907 INFO L628 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 [2019-09-08 10:07:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29896 states. [2019-09-08 10:07:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29896 to 15102. [2019-09-08 10:07:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15102 states. [2019-09-08 10:07:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15102 states to 15102 states and 24296 transitions. [2019-09-08 10:07:47,841 INFO L78 Accepts]: Start accepts. Automaton has 15102 states and 24296 transitions. Word has length 471 [2019-09-08 10:07:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:47,841 INFO L475 AbstractCegarLoop]: Abstraction has 15102 states and 24296 transitions. [2019-09-08 10:07:47,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 15102 states and 24296 transitions. [2019-09-08 10:07:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-09-08 10:07:47,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:47,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:47,881 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash 692520227, now seen corresponding path program 1 times [2019-09-08 10:07:47,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:47,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:47,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:48,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:48,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:48,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:48,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:48,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:48,245 INFO L87 Difference]: Start difference. First operand 15102 states and 24296 transitions. Second operand 3 states. [2019-09-08 10:07:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:49,455 INFO L93 Difference]: Finished difference Result 44891 states and 72171 transitions. [2019-09-08 10:07:49,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:49,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 472 [2019-09-08 10:07:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:49,546 INFO L225 Difference]: With dead ends: 44891 [2019-09-08 10:07:49,546 INFO L226 Difference]: Without dead ends: 30013 [2019-09-08 10:07:49,591 INFO L628 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 [2019-09-08 10:07:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-09-08 10:07:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 15219. [2019-09-08 10:07:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15219 states. [2019-09-08 10:07:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15219 states to 15219 states and 24442 transitions. [2019-09-08 10:07:51,369 INFO L78 Accepts]: Start accepts. Automaton has 15219 states and 24442 transitions. Word has length 472 [2019-09-08 10:07:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:51,369 INFO L475 AbstractCegarLoop]: Abstraction has 15219 states and 24442 transitions. [2019-09-08 10:07:51,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 15219 states and 24442 transitions. [2019-09-08 10:07:51,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-08 10:07:51,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:51,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:51,409 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1994724451, now seen corresponding path program 1 times [2019-09-08 10:07:51,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:51,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:51,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:51,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:51,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:52,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:52,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:52,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:52,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:52,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:52,022 INFO L87 Difference]: Start difference. First operand 15219 states and 24442 transitions. Second operand 3 states. [2019-09-08 10:07:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:53,153 INFO L93 Difference]: Finished difference Result 43846 states and 70265 transitions. [2019-09-08 10:07:53,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:53,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2019-09-08 10:07:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:53,215 INFO L225 Difference]: With dead ends: 43846 [2019-09-08 10:07:53,215 INFO L226 Difference]: Without dead ends: 29596 [2019-09-08 10:07:53,249 INFO L628 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 [2019-09-08 10:07:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29596 states. [2019-09-08 10:07:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29596 to 29594. [2019-09-08 10:07:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29594 states. [2019-09-08 10:07:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29594 states to 29594 states and 47307 transitions. [2019-09-08 10:07:54,389 INFO L78 Accepts]: Start accepts. Automaton has 29594 states and 47307 transitions. Word has length 473 [2019-09-08 10:07:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:54,390 INFO L475 AbstractCegarLoop]: Abstraction has 29594 states and 47307 transitions. [2019-09-08 10:07:54,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29594 states and 47307 transitions. [2019-09-08 10:07:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-08 10:07:54,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:54,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:54,425 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:54,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash -57354464, now seen corresponding path program 1 times [2019-09-08 10:07:54,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:54,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:54,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:55,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:55,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:07:55,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:07:55,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:07:55,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:55,442 INFO L87 Difference]: Start difference. First operand 29594 states and 47307 transitions. Second operand 4 states. [2019-09-08 10:07:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:57,303 INFO L93 Difference]: Finished difference Result 83580 states and 133043 transitions. [2019-09-08 10:07:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:07:57,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 473 [2019-09-08 10:07:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:57,399 INFO L225 Difference]: With dead ends: 83580 [2019-09-08 10:07:57,399 INFO L226 Difference]: Without dead ends: 56266 [2019-09-08 10:07:57,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:07:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56266 states. [2019-09-08 10:07:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56266 to 30887. [2019-09-08 10:07:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30887 states. [2019-09-08 10:07:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30887 states to 30887 states and 49586 transitions. [2019-09-08 10:07:58,788 INFO L78 Accepts]: Start accepts. Automaton has 30887 states and 49586 transitions. Word has length 473 [2019-09-08 10:07:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:58,789 INFO L475 AbstractCegarLoop]: Abstraction has 30887 states and 49586 transitions. [2019-09-08 10:07:58,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:07:58,789 INFO L276 IsEmpty]: Start isEmpty. Operand 30887 states and 49586 transitions. [2019-09-08 10:07:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 10:07:58,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:58,822 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:58,823 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:58,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1679281834, now seen corresponding path program 1 times [2019-09-08 10:07:58,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:58,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:58,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:58,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:58,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:59,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:59,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:59,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:59,300 INFO L87 Difference]: Start difference. First operand 30887 states and 49586 transitions. Second operand 3 states. [2019-09-08 10:08:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:02,143 INFO L93 Difference]: Finished difference Result 85630 states and 136255 transitions. [2019-09-08 10:08:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:02,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-09-08 10:08:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:02,247 INFO L225 Difference]: With dead ends: 85630 [2019-09-08 10:08:02,247 INFO L226 Difference]: Without dead ends: 58296 [2019-09-08 10:08:02,293 INFO L628 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 [2019-09-08 10:08:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58296 states. [2019-09-08 10:08:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58296 to 31334. [2019-09-08 10:08:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31334 states. [2019-09-08 10:08:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31334 states to 31334 states and 50261 transitions. [2019-09-08 10:08:03,733 INFO L78 Accepts]: Start accepts. Automaton has 31334 states and 50261 transitions. Word has length 476 [2019-09-08 10:08:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:03,733 INFO L475 AbstractCegarLoop]: Abstraction has 31334 states and 50261 transitions. [2019-09-08 10:08:03,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 31334 states and 50261 transitions. [2019-09-08 10:08:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-08 10:08:03,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:03,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:03,768 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:03,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1892744572, now seen corresponding path program 1 times [2019-09-08 10:08:03,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:03,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:03,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:03,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:03,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:04,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:04,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:04,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:04,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:04,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:04,137 INFO L87 Difference]: Start difference. First operand 31334 states and 50261 transitions. Second operand 3 states. [2019-09-08 10:08:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:06,412 INFO L93 Difference]: Finished difference Result 86359 states and 137304 transitions. [2019-09-08 10:08:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:06,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 477 [2019-09-08 10:08:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:06,495 INFO L225 Difference]: With dead ends: 86359 [2019-09-08 10:08:06,496 INFO L226 Difference]: Without dead ends: 58911 [2019-09-08 10:08:06,551 INFO L628 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 [2019-09-08 10:08:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58911 states. [2019-09-08 10:08:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58911 to 31981. [2019-09-08 10:08:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31981 states. [2019-09-08 10:08:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31981 states to 31981 states and 51201 transitions. [2019-09-08 10:08:08,358 INFO L78 Accepts]: Start accepts. Automaton has 31981 states and 51201 transitions. Word has length 477 [2019-09-08 10:08:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:08,358 INFO L475 AbstractCegarLoop]: Abstraction has 31981 states and 51201 transitions. [2019-09-08 10:08:08,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 31981 states and 51201 transitions. [2019-09-08 10:08:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-08 10:08:08,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:08,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:08,388 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash -428994466, now seen corresponding path program 1 times [2019-09-08 10:08:08,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:08,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:08,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:08,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:08,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:08,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:08,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:08,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:08,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:08,678 INFO L87 Difference]: Start difference. First operand 31981 states and 51201 transitions. Second operand 3 states. [2019-09-08 10:08:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:11,944 INFO L93 Difference]: Finished difference Result 87271 states and 138488 transitions. [2019-09-08 10:08:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:11,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-08 10:08:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:12,014 INFO L225 Difference]: With dead ends: 87271 [2019-09-08 10:08:12,014 INFO L226 Difference]: Without dead ends: 59765 [2019-09-08 10:08:12,056 INFO L628 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 [2019-09-08 10:08:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59765 states. [2019-09-08 10:08:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59765 to 32835. [2019-09-08 10:08:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32835 states. [2019-09-08 10:08:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32835 states to 32835 states and 52263 transitions. [2019-09-08 10:08:13,864 INFO L78 Accepts]: Start accepts. Automaton has 32835 states and 52263 transitions. Word has length 478 [2019-09-08 10:08:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:13,864 INFO L475 AbstractCegarLoop]: Abstraction has 32835 states and 52263 transitions. [2019-09-08 10:08:13,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:08:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 32835 states and 52263 transitions. [2019-09-08 10:08:13,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-08 10:08:13,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:13,890 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:13,890 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:13,891 INFO L82 PathProgramCache]: Analyzing trace with hash 275233195, now seen corresponding path program 1 times [2019-09-08 10:08:13,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:13,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:13,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:13,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:13,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:14,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:14,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:08:14,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:08:14,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:08:14,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:08:14,576 INFO L87 Difference]: Start difference. First operand 32835 states and 52263 transitions. Second operand 5 states. [2019-09-08 10:08:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:17,545 INFO L93 Difference]: Finished difference Result 54063 states and 85217 transitions. [2019-09-08 10:08:17,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:08:17,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 479 [2019-09-08 10:08:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:17,586 INFO L225 Difference]: With dead ends: 54063 [2019-09-08 10:08:17,586 INFO L226 Difference]: Without dead ends: 32837 [2019-09-08 10:08:17,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:08:17,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32837 states. [2019-09-08 10:08:19,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32837 to 32835. [2019-09-08 10:08:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32835 states. [2019-09-08 10:08:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32835 states to 32835 states and 52039 transitions. [2019-09-08 10:08:19,381 INFO L78 Accepts]: Start accepts. Automaton has 32835 states and 52039 transitions. Word has length 479 [2019-09-08 10:08:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:19,382 INFO L475 AbstractCegarLoop]: Abstraction has 32835 states and 52039 transitions. [2019-09-08 10:08:19,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:08:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32835 states and 52039 transitions. [2019-09-08 10:08:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-08 10:08:19,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:19,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:19,410 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:19,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1098672624, now seen corresponding path program 1 times [2019-09-08 10:08:19,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:19,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:19,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:21,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:21,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:08:21,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:08:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:08:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:08:21,637 INFO L87 Difference]: Start difference. First operand 32835 states and 52039 transitions. Second operand 16 states. [2019-09-08 10:08:22,490 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-09-08 10:08:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:30,150 INFO L93 Difference]: Finished difference Result 64122 states and 101198 transitions. [2019-09-08 10:08:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 10:08:30,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 479 [2019-09-08 10:08:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:30,226 INFO L225 Difference]: With dead ends: 64122 [2019-09-08 10:08:30,227 INFO L226 Difference]: Without dead ends: 58860 [2019-09-08 10:08:30,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=331, Invalid=791, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:08:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58860 states. [2019-09-08 10:08:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58860 to 35351. [2019-09-08 10:08:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35351 states. [2019-09-08 10:08:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35351 states to 35351 states and 55707 transitions. [2019-09-08 10:08:32,442 INFO L78 Accepts]: Start accepts. Automaton has 35351 states and 55707 transitions. Word has length 479 [2019-09-08 10:08:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:32,443 INFO L475 AbstractCegarLoop]: Abstraction has 35351 states and 55707 transitions. [2019-09-08 10:08:32,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:08:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 35351 states and 55707 transitions. [2019-09-08 10:08:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-08 10:08:32,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:32,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:32,471 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:32,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:32,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1827309321, now seen corresponding path program 1 times [2019-09-08 10:08:32,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:32,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:32,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:33,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:33,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:08:33,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:08:33,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:08:33,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:08:33,542 INFO L87 Difference]: Start difference. First operand 35351 states and 55707 transitions. Second operand 4 states. [2019-09-08 10:08:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:37,591 INFO L93 Difference]: Finished difference Result 104059 states and 163968 transitions. [2019-09-08 10:08:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:08:37,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 479 [2019-09-08 10:08:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:37,677 INFO L225 Difference]: With dead ends: 104059 [2019-09-08 10:08:37,677 INFO L226 Difference]: Without dead ends: 68971 [2019-09-08 10:08:37,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:08:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68971 states. [2019-09-08 10:08:43,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68971 to 68969. [2019-09-08 10:08:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68969 states. [2019-09-08 10:08:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68969 states to 68969 states and 108219 transitions. [2019-09-08 10:08:43,613 INFO L78 Accepts]: Start accepts. Automaton has 68969 states and 108219 transitions. Word has length 479 [2019-09-08 10:08:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:43,613 INFO L475 AbstractCegarLoop]: Abstraction has 68969 states and 108219 transitions. [2019-09-08 10:08:43,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:08:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 68969 states and 108219 transitions. [2019-09-08 10:08:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-08 10:08:43,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:43,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:43,699 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:43,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:43,700 INFO L82 PathProgramCache]: Analyzing trace with hash 904031781, now seen corresponding path program 1 times [2019-09-08 10:08:43,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:43,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:43,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:43,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:43,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:44,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:44,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:44,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:44,177 INFO L87 Difference]: Start difference. First operand 68969 states and 108219 transitions. Second operand 3 states. [2019-09-08 10:08:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:52,506 INFO L93 Difference]: Finished difference Result 200347 states and 313280 transitions. [2019-09-08 10:08:52,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:08:52,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 481 [2019-09-08 10:08:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:52,664 INFO L225 Difference]: With dead ends: 200347 [2019-09-08 10:08:52,664 INFO L226 Difference]: Without dead ends: 134946 [2019-09-08 10:08:52,725 INFO L628 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 [2019-09-08 10:08:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134946 states. [2019-09-08 10:09:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134946 to 134944. [2019-09-08 10:09:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134944 states. [2019-09-08 10:09:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134944 states to 134944 states and 210509 transitions. [2019-09-08 10:09:03,391 INFO L78 Accepts]: Start accepts. Automaton has 134944 states and 210509 transitions. Word has length 481 [2019-09-08 10:09:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:09:03,391 INFO L475 AbstractCegarLoop]: Abstraction has 134944 states and 210509 transitions. [2019-09-08 10:09:03,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:09:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 134944 states and 210509 transitions. [2019-09-08 10:09:03,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-08 10:09:03,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:09:03,511 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:09:03,511 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:09:03,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:09:03,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1816704969, now seen corresponding path program 1 times [2019-09-08 10:09:03,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:09:03,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:09:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:03,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:09:03,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:09:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:09:03,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:09:03,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:09:03,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:09:03,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:09:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:09:03,980 INFO L87 Difference]: Start difference. First operand 134944 states and 210509 transitions. Second operand 3 states. [2019-09-08 10:09:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:09:22,817 INFO L93 Difference]: Finished difference Result 396488 states and 617529 transitions. [2019-09-08 10:09:22,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:09:22,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 481 [2019-09-08 10:09:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:09:23,201 INFO L225 Difference]: With dead ends: 396488 [2019-09-08 10:09:23,202 INFO L226 Difference]: Without dead ends: 265558 [2019-09-08 10:09:23,353 INFO L628 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 [2019-09-08 10:09:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265558 states. [2019-09-08 10:09:44,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265558 to 265556. [2019-09-08 10:09:44,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265556 states. [2019-09-08 10:09:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265556 states to 265556 states and 412343 transitions. [2019-09-08 10:09:45,310 INFO L78 Accepts]: Start accepts. Automaton has 265556 states and 412343 transitions. Word has length 481 [2019-09-08 10:09:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:09:45,310 INFO L475 AbstractCegarLoop]: Abstraction has 265556 states and 412343 transitions. [2019-09-08 10:09:45,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:09:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 265556 states and 412343 transitions. [2019-09-08 10:09:45,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-09-08 10:09:45,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:09:45,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:09:45,574 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:09:45,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:09:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash -898482756, now seen corresponding path program 1 times [2019-09-08 10:09:45,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:09:45,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:09:45,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:45,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:09:45,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:09:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:09:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:09:46,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:09:46,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:09:46,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:09:46,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:09:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:09:46,613 INFO L87 Difference]: Start difference. First operand 265556 states and 412343 transitions. Second operand 3 states. [2019-09-08 10:10:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:10:28,944 INFO L93 Difference]: Finished difference Result 775811 states and 1201694 transitions. [2019-09-08 10:10:28,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:10:28,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 483 [2019-09-08 10:10:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:10:29,699 INFO L225 Difference]: With dead ends: 775811 [2019-09-08 10:10:29,699 INFO L226 Difference]: Without dead ends: 521931 [2019-09-08 10:10:29,911 INFO L628 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 [2019-09-08 10:10:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521931 states. [2019-09-08 10:11:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521931 to 521929. [2019-09-08 10:11:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521929 states. [2019-09-08 10:11:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521929 states to 521929 states and 806194 transitions. [2019-09-08 10:11:20,502 INFO L78 Accepts]: Start accepts. Automaton has 521929 states and 806194 transitions. Word has length 483 [2019-09-08 10:11:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:20,502 INFO L475 AbstractCegarLoop]: Abstraction has 521929 states and 806194 transitions. [2019-09-08 10:11:20,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 521929 states and 806194 transitions. [2019-09-08 10:11:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-09-08 10:11:21,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:21,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:11:21,117 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash -801853505, now seen corresponding path program 1 times [2019-09-08 10:11:21,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:21,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:21,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:11:21,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:21,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:11:21,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:11:21,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:11:21,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:11:21,665 INFO L87 Difference]: Start difference. First operand 521929 states and 806194 transitions. Second operand 4 states. [2019-09-08 10:12:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:46,565 INFO L93 Difference]: Finished difference Result 1372701 states and 2102690 transitions. [2019-09-08 10:12:46,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:12:46,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 483 [2019-09-08 10:12:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:47,920 INFO L225 Difference]: With dead ends: 1372701 [2019-09-08 10:12:47,921 INFO L226 Difference]: Without dead ends: 957147 [2019-09-08 10:12:48,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:12:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957147 states. [2019-09-08 10:13:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957147 to 568841. [2019-09-08 10:13:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568841 states. [2019-09-08 10:13:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568841 states to 568841 states and 885224 transitions. [2019-09-08 10:13:57,495 INFO L78 Accepts]: Start accepts. Automaton has 568841 states and 885224 transitions. Word has length 483 [2019-09-08 10:13:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:57,496 INFO L475 AbstractCegarLoop]: Abstraction has 568841 states and 885224 transitions. [2019-09-08 10:13:57,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:13:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 568841 states and 885224 transitions. [2019-09-08 10:13:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-08 10:13:58,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:58,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:58,080 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2015802514, now seen corresponding path program 1 times [2019-09-08 10:13:58,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:58,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:58,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:58,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:58,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:13:58,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:13:58,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:13:58,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:13:58,580 INFO L87 Difference]: Start difference. First operand 568841 states and 885224 transitions. Second operand 4 states. [2019-09-08 10:15:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:45,801 INFO L93 Difference]: Finished difference Result 1568154 states and 2429995 transitions. [2019-09-08 10:15:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:15:45,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2019-09-08 10:15:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:47,370 INFO L225 Difference]: With dead ends: 1568154 [2019-09-08 10:15:47,370 INFO L226 Difference]: Without dead ends: 1054360 [2019-09-08 10:15:47,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:15:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054360 states. [2019-09-08 10:16:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054360 to 582682. [2019-09-08 10:16:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582682 states. [2019-09-08 10:16:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582682 states to 582682 states and 909857 transitions. [2019-09-08 10:16:55,412 INFO L78 Accepts]: Start accepts. Automaton has 582682 states and 909857 transitions. Word has length 485 [2019-09-08 10:16:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:55,412 INFO L475 AbstractCegarLoop]: Abstraction has 582682 states and 909857 transitions. [2019-09-08 10:16:55,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:16:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 582682 states and 909857 transitions. [2019-09-08 10:16:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-08 10:16:55,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:55,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:55,965 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:55,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:55,965 INFO L82 PathProgramCache]: Analyzing trace with hash -699969512, now seen corresponding path program 1 times [2019-09-08 10:16:55,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:55,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:05,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:05,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:05,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:05,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:17:05,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:17:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:17:05,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:05,299 INFO L87 Difference]: Start difference. First operand 582682 states and 909857 transitions. Second operand 3 states.