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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:10:47,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:10:47,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:10:47,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:10:47,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:10:47,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:10:47,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:10:47,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:10:47,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:10:47,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:10:47,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:10:47,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:10:47,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:10:47,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:10:47,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:10:47,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:10:47,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:10:47,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:10:47,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:10:47,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:10:47,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:10:47,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:10:47,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:10:47,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:10:47,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:10:47,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:10:47,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:10:47,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:10:47,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:10:47,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:10:47,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:10:47,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:10:47,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:10:47,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:10:47,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:10:47,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:10:47,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:10:47,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:10:47,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:10:47,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:10:47,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:10:47,414 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:10:47,428 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:10:47,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:10:47,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:10:47,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:10:47,430 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:10:47,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:10:47,430 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:10:47,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:10:47,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:10:47,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:10:47,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:10:47,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:10:47,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:10:47,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:10:47,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:10:47,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:10:47,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:10:47,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:10:47,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:10:47,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:10:47,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:10:47,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:10:47,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:10:47,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:10:47,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:10:47,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:10:47,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:10:47,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:10:47,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:10:47,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:10:47,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:10:47,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:10:47,494 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:10:47,495 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:10:47,496 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:10:47,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e027244/3a7bde12561046ce8f0cd009812ad98f/FLAG9fe702495 [2019-09-08 10:10:48,193 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:10:48,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:10:48,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e027244/3a7bde12561046ce8f0cd009812ad98f/FLAG9fe702495 [2019-09-08 10:10:48,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2e027244/3a7bde12561046ce8f0cd009812ad98f [2019-09-08 10:10:48,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:10:48,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:10:48,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:10:48,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:10:48,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:10:48,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:10:48" (1/1) ... [2019-09-08 10:10:48,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256458f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:48, skipping insertion in model container [2019-09-08 10:10:48,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:10:48" (1/1) ... [2019-09-08 10:10:48,345 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:10:48,524 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:10:49,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:10:49,966 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:10:51,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:10:51,325 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:10:51,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51 WrapperNode [2019-09-08 10:10:51,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:10:51,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:10:51,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:10:51,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:10:51,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51" (1/1) ... [2019-09-08 10:10:51,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51" (1/1) ... [2019-09-08 10:10:51,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51" (1/1) ... [2019-09-08 10:10:51,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51" (1/1) ... [2019-09-08 10:10:51,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51" (1/1) ... [2019-09-08 10:10:51,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51" (1/1) ... [2019-09-08 10:10:51,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51" (1/1) ... [2019-09-08 10:10:51,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:10:51,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:10:51,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:10:51,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:10:51,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51" (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:10:51,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:10:51,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:10:51,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:10:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:10:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:10:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:10:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:10:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:10:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:10:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:10:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:10:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:10:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:10:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:10:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:10:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:10:51,783 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:10:51,784 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:10:51,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:10:51,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:10:51,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:10:55,868 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:10:55,868 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:10:55,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:10:55 BoogieIcfgContainer [2019-09-08 10:10:55,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:10:55,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:10:55,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:10:55,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:10:55,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:10:48" (1/3) ... [2019-09-08 10:10:55,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cde2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:10:55, skipping insertion in model container [2019-09-08 10:10:55,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:10:51" (2/3) ... [2019-09-08 10:10:55,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cde2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:10:55, skipping insertion in model container [2019-09-08 10:10:55,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:10:55" (3/3) ... [2019-09-08 10:10:55,879 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:10:55,890 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:10:55,902 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 10:10:55,920 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 10:10:55,962 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:10:55,962 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:10:55,963 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:10:55,963 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:10:55,963 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:10:55,963 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:10:55,963 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:10:55,963 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:10:55,964 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:10:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states. [2019-09-08 10:10:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-09-08 10:10:56,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:10:56,066 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:10:56,068 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:10:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:10:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1122091667, now seen corresponding path program 1 times [2019-09-08 10:10:56,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:10:56,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:10:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:56,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:10:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:10:58,614 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:10:58,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:10:58,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:10:58,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:10:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:10:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:10:58,643 INFO L87 Difference]: Start difference. First operand 1393 states. Second operand 4 states. [2019-09-08 10:10:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:10:59,316 INFO L93 Difference]: Finished difference Result 4125 states and 7467 transitions. [2019-09-08 10:10:59,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:10:59,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 473 [2019-09-08 10:10:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:10:59,367 INFO L225 Difference]: With dead ends: 4125 [2019-09-08 10:10:59,368 INFO L226 Difference]: Without dead ends: 2741 [2019-09-08 10:10:59,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:10:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2019-09-08 10:10:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2688. [2019-09-08 10:10:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2688 states. [2019-09-08 10:10:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 4398 transitions. [2019-09-08 10:10:59,633 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 4398 transitions. Word has length 473 [2019-09-08 10:10:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:10:59,638 INFO L475 AbstractCegarLoop]: Abstraction has 2688 states and 4398 transitions. [2019-09-08 10:10:59,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:10:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 4398 transitions. [2019-09-08 10:10:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-09-08 10:10:59,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:10:59,659 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] [2019-09-08 10:10:59,660 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:10:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:10:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1084658380, now seen corresponding path program 1 times [2019-09-08 10:10:59,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:10:59,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:10:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:59,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:10:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:00,423 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:00,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:00,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:00,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:00,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:00,429 INFO L87 Difference]: Start difference. First operand 2688 states and 4398 transitions. Second operand 3 states. [2019-09-08 10:11:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:00,911 INFO L93 Difference]: Finished difference Result 7793 states and 12713 transitions. [2019-09-08 10:11:00,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:00,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-09-08 10:11:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:00,949 INFO L225 Difference]: With dead ends: 7793 [2019-09-08 10:11:00,950 INFO L226 Difference]: Without dead ends: 5319 [2019-09-08 10:11:00,959 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:11:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2019-09-08 10:11:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5268. [2019-09-08 10:11:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5268 states. [2019-09-08 10:11:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 8596 transitions. [2019-09-08 10:11:01,289 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 8596 transitions. Word has length 475 [2019-09-08 10:11:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:01,292 INFO L475 AbstractCegarLoop]: Abstraction has 5268 states and 8596 transitions. [2019-09-08 10:11:01,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 8596 transitions. [2019-09-08 10:11:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-09-08 10:11:01,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:01,318 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:11:01,318 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1269879540, now seen corresponding path program 1 times [2019-09-08 10:11:01,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:01,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:01,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:01,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:01,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:01,682 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:01,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:01,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:01,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:01,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:01,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:01,685 INFO L87 Difference]: Start difference. First operand 5268 states and 8596 transitions. Second operand 3 states. [2019-09-08 10:11:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:02,144 INFO L93 Difference]: Finished difference Result 15707 states and 25620 transitions. [2019-09-08 10:11:02,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:02,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-09-08 10:11:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:02,198 INFO L225 Difference]: With dead ends: 15707 [2019-09-08 10:11:02,199 INFO L226 Difference]: Without dead ends: 10491 [2019-09-08 10:11:02,213 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:11:02,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10491 states. [2019-09-08 10:11:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10491 to 5315. [2019-09-08 10:11:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5315 states. [2019-09-08 10:11:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5315 states to 5315 states and 8670 transitions. [2019-09-08 10:11:02,597 INFO L78 Accepts]: Start accepts. Automaton has 5315 states and 8670 transitions. Word has length 476 [2019-09-08 10:11:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:02,597 INFO L475 AbstractCegarLoop]: Abstraction has 5315 states and 8670 transitions. [2019-09-08 10:11:02,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 5315 states and 8670 transitions. [2019-09-08 10:11:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-08 10:11:02,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:02,619 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:11:02,620 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:02,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1081134361, now seen corresponding path program 1 times [2019-09-08 10:11:02,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:02,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:02,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:02,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:02,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:03,097 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:03,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:03,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:03,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:03,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:03,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:03,099 INFO L87 Difference]: Start difference. First operand 5315 states and 8670 transitions. Second operand 3 states. [2019-09-08 10:11:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:03,776 INFO L93 Difference]: Finished difference Result 15285 states and 24839 transitions. [2019-09-08 10:11:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:03,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 477 [2019-09-08 10:11:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:03,833 INFO L225 Difference]: With dead ends: 15285 [2019-09-08 10:11:03,833 INFO L226 Difference]: Without dead ends: 10369 [2019-09-08 10:11:03,846 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:11:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10369 states. [2019-09-08 10:11:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10369 to 10320. [2019-09-08 10:11:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10320 states. [2019-09-08 10:11:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10320 states to 10320 states and 16752 transitions. [2019-09-08 10:11:04,319 INFO L78 Accepts]: Start accepts. Automaton has 10320 states and 16752 transitions. Word has length 477 [2019-09-08 10:11:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:04,320 INFO L475 AbstractCegarLoop]: Abstraction has 10320 states and 16752 transitions. [2019-09-08 10:11:04,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10320 states and 16752 transitions. [2019-09-08 10:11:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-09-08 10:11:04,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:04,347 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:11:04,347 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash 156018356, now seen corresponding path program 1 times [2019-09-08 10:11:04,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:04,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:04,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:04,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:05,100 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:05,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:05,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:05,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:05,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:05,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:05,103 INFO L87 Difference]: Start difference. First operand 10320 states and 16752 transitions. Second operand 3 states. [2019-09-08 10:11:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:05,840 INFO L93 Difference]: Finished difference Result 30704 states and 49811 transitions. [2019-09-08 10:11:05,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:05,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 477 [2019-09-08 10:11:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:05,915 INFO L225 Difference]: With dead ends: 30704 [2019-09-08 10:11:05,916 INFO L226 Difference]: Without dead ends: 20528 [2019-09-08 10:11:05,950 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:11:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20528 states. [2019-09-08 10:11:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20528 to 10418. [2019-09-08 10:11:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10418 states. [2019-09-08 10:11:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10418 states to 10418 states and 16903 transitions. [2019-09-08 10:11:06,724 INFO L78 Accepts]: Start accepts. Automaton has 10418 states and 16903 transitions. Word has length 477 [2019-09-08 10:11:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:06,724 INFO L475 AbstractCegarLoop]: Abstraction has 10418 states and 16903 transitions. [2019-09-08 10:11:06,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 10418 states and 16903 transitions. [2019-09-08 10:11:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-09-08 10:11:06,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:06,754 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:11:06,754 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:06,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:06,755 INFO L82 PathProgramCache]: Analyzing trace with hash 729654203, now seen corresponding path program 1 times [2019-09-08 10:11:06,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:06,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:06,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:06,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:06,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:07,191 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:07,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:07,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:07,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:07,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:07,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:07,193 INFO L87 Difference]: Start difference. First operand 10418 states and 16903 transitions. Second operand 3 states. [2019-09-08 10:11:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:07,932 INFO L93 Difference]: Finished difference Result 30839 states and 49992 transitions. [2019-09-08 10:11:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:07,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 478 [2019-09-08 10:11:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:07,982 INFO L225 Difference]: With dead ends: 30839 [2019-09-08 10:11:07,983 INFO L226 Difference]: Without dead ends: 20645 [2019-09-08 10:11:08,011 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:11:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20645 states. [2019-09-08 10:11:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20645 to 10535. [2019-09-08 10:11:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10535 states. [2019-09-08 10:11:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10535 states to 10535 states and 17049 transitions. [2019-09-08 10:11:08,678 INFO L78 Accepts]: Start accepts. Automaton has 10535 states and 17049 transitions. Word has length 478 [2019-09-08 10:11:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:08,679 INFO L475 AbstractCegarLoop]: Abstraction has 10535 states and 17049 transitions. [2019-09-08 10:11:08,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 10535 states and 17049 transitions. [2019-09-08 10:11:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-08 10:11:08,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:08,713 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:11:08,713 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:08,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:08,722 INFO L82 PathProgramCache]: Analyzing trace with hash 291290657, now seen corresponding path program 1 times [2019-09-08 10:11:08,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:08,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:08,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:09,490 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:09,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:09,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:11:09,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:11:09,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:11:09,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:11:09,493 INFO L87 Difference]: Start difference. First operand 10535 states and 17049 transitions. Second operand 4 states. [2019-09-08 10:11:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:10,383 INFO L93 Difference]: Finished difference Result 29546 states and 47561 transitions. [2019-09-08 10:11:10,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:11:10,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 479 [2019-09-08 10:11:10,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:10,443 INFO L225 Difference]: With dead ends: 29546 [2019-09-08 10:11:10,443 INFO L226 Difference]: Without dead ends: 20428 [2019-09-08 10:11:10,472 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:11:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20428 states. [2019-09-08 10:11:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20428 to 11470. [2019-09-08 10:11:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11470 states. [2019-09-08 10:11:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11470 states to 11470 states and 18697 transitions. [2019-09-08 10:11:11,354 INFO L78 Accepts]: Start accepts. Automaton has 11470 states and 18697 transitions. Word has length 479 [2019-09-08 10:11:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:11,355 INFO L475 AbstractCegarLoop]: Abstraction has 11470 states and 18697 transitions. [2019-09-08 10:11:11,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:11:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 11470 states and 18697 transitions. [2019-09-08 10:11:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-09-08 10:11:11,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:11,387 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:11:11,387 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1919860958, now seen corresponding path program 1 times [2019-09-08 10:11:11,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:11,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:11,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:11,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:11,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:11,909 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:11,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:11,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:11,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:11,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:11,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:11,912 INFO L87 Difference]: Start difference. First operand 11470 states and 18697 transitions. Second operand 3 states. [2019-09-08 10:11:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:13,001 INFO L93 Difference]: Finished difference Result 31558 states and 51184 transitions. [2019-09-08 10:11:13,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:13,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 479 [2019-09-08 10:11:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:13,064 INFO L225 Difference]: With dead ends: 31558 [2019-09-08 10:11:13,065 INFO L226 Difference]: Without dead ends: 21648 [2019-09-08 10:11:13,091 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:11:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21648 states. [2019-09-08 10:11:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21648 to 21601. [2019-09-08 10:11:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21601 states. [2019-09-08 10:11:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21601 states to 21601 states and 34993 transitions. [2019-09-08 10:11:14,037 INFO L78 Accepts]: Start accepts. Automaton has 21601 states and 34993 transitions. Word has length 479 [2019-09-08 10:11:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:14,038 INFO L475 AbstractCegarLoop]: Abstraction has 21601 states and 34993 transitions. [2019-09-08 10:11:14,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 21601 states and 34993 transitions. [2019-09-08 10:11:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-08 10:11:14,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:14,076 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] [2019-09-08 10:11:14,076 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash -548860705, now seen corresponding path program 1 times [2019-09-08 10:11:14,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:14,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:14,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:14,969 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:14,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:14,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:14,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:14,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:14,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:14,971 INFO L87 Difference]: Start difference. First operand 21601 states and 34993 transitions. Second operand 3 states. [2019-09-08 10:11:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:16,247 INFO L93 Difference]: Finished difference Result 57772 states and 92476 transitions. [2019-09-08 10:11:16,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:16,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 482 [2019-09-08 10:11:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:16,385 INFO L225 Difference]: With dead ends: 57772 [2019-09-08 10:11:16,386 INFO L226 Difference]: Without dead ends: 39724 [2019-09-08 10:11:16,436 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:11:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39724 states. [2019-09-08 10:11:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39724 to 22048. [2019-09-08 10:11:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22048 states. [2019-09-08 10:11:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22048 states to 22048 states and 35668 transitions. [2019-09-08 10:11:17,509 INFO L78 Accepts]: Start accepts. Automaton has 22048 states and 35668 transitions. Word has length 482 [2019-09-08 10:11:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:17,510 INFO L475 AbstractCegarLoop]: Abstraction has 22048 states and 35668 transitions. [2019-09-08 10:11:17,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 22048 states and 35668 transitions. [2019-09-08 10:11:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-09-08 10:11:17,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:17,531 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:17,532 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -129185720, now seen corresponding path program 1 times [2019-09-08 10:11:17,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:17,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:17,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:17,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:17,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:17,818 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:17,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:17,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:17,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:17,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:17,820 INFO L87 Difference]: Start difference. First operand 22048 states and 35668 transitions. Second operand 3 states. [2019-09-08 10:11:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:19,301 INFO L93 Difference]: Finished difference Result 58501 states and 93525 transitions. [2019-09-08 10:11:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:19,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 483 [2019-09-08 10:11:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:19,359 INFO L225 Difference]: With dead ends: 58501 [2019-09-08 10:11:19,359 INFO L226 Difference]: Without dead ends: 40339 [2019-09-08 10:11:19,394 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:11:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40339 states. [2019-09-08 10:11:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40339 to 22695. [2019-09-08 10:11:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22695 states. [2019-09-08 10:11:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22695 states to 22695 states and 36608 transitions. [2019-09-08 10:11:20,699 INFO L78 Accepts]: Start accepts. Automaton has 22695 states and 36608 transitions. Word has length 483 [2019-09-08 10:11:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:20,699 INFO L475 AbstractCegarLoop]: Abstraction has 22695 states and 36608 transitions. [2019-09-08 10:11:20,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 22695 states and 36608 transitions. [2019-09-08 10:11:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-09-08 10:11:20,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:20,724 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] [2019-09-08 10:11:20,725 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:20,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:20,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1709794957, now seen corresponding path program 1 times [2019-09-08 10:11:20,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:20,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:20,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:21,025 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,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:21,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:21,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:21,029 INFO L87 Difference]: Start difference. First operand 22695 states and 36608 transitions. Second operand 3 states. [2019-09-08 10:11:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:22,640 INFO L93 Difference]: Finished difference Result 59413 states and 94709 transitions. [2019-09-08 10:11:22,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:22,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2019-09-08 10:11:22,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:22,703 INFO L225 Difference]: With dead ends: 59413 [2019-09-08 10:11:22,703 INFO L226 Difference]: Without dead ends: 41193 [2019-09-08 10:11:23,647 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:11:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41193 states. [2019-09-08 10:11:24,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41193 to 23549. [2019-09-08 10:11:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23549 states. [2019-09-08 10:11:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23549 states to 23549 states and 37670 transitions. [2019-09-08 10:11:24,699 INFO L78 Accepts]: Start accepts. Automaton has 23549 states and 37670 transitions. Word has length 484 [2019-09-08 10:11:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:24,700 INFO L475 AbstractCegarLoop]: Abstraction has 23549 states and 37670 transitions. [2019-09-08 10:11:24,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 23549 states and 37670 transitions. [2019-09-08 10:11:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-08 10:11:24,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:24,727 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:11:24,728 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1829044870, now seen corresponding path program 1 times [2019-09-08 10:11:24,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:24,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:24,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:25,179 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:25,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:25,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:25,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:25,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:25,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:25,182 INFO L87 Difference]: Start difference. First operand 23549 states and 37670 transitions. Second operand 3 states. [2019-09-08 10:11:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:28,110 INFO L93 Difference]: Finished difference Result 47173 states and 73878 transitions. [2019-09-08 10:11:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:28,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 485 [2019-09-08 10:11:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:28,149 INFO L225 Difference]: With dead ends: 47173 [2019-09-08 10:11:28,150 INFO L226 Difference]: Without dead ends: 35297 [2019-09-08 10:11:28,175 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:11:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35297 states. [2019-09-08 10:11:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35297 to 35173. [2019-09-08 10:11:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35173 states. [2019-09-08 10:11:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35173 states to 35173 states and 55246 transitions. [2019-09-08 10:11:30,072 INFO L78 Accepts]: Start accepts. Automaton has 35173 states and 55246 transitions. Word has length 485 [2019-09-08 10:11:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:30,072 INFO L475 AbstractCegarLoop]: Abstraction has 35173 states and 55246 transitions. [2019-09-08 10:11:30,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 35173 states and 55246 transitions. [2019-09-08 10:11:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-09-08 10:11:30,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:30,108 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:11:30,108 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2064605616, now seen corresponding path program 1 times [2019-09-08 10:11:30,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:30,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:30,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:30,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:30,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:31,439 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:31,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:31,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:11:31,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:11:31,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:11:31,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:11:31,442 INFO L87 Difference]: Start difference. First operand 35173 states and 55246 transitions. Second operand 4 states. [2019-09-08 10:11:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:35,637 INFO L93 Difference]: Finished difference Result 103588 states and 162695 transitions. [2019-09-08 10:11:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:11:35,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2019-09-08 10:11:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:35,714 INFO L225 Difference]: With dead ends: 103588 [2019-09-08 10:11:35,715 INFO L226 Difference]: Without dead ends: 68678 [2019-09-08 10:11:35,753 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:11:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68678 states. [2019-09-08 10:11:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68678 to 68636. [2019-09-08 10:11:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68636 states. [2019-09-08 10:11:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68636 states to 68636 states and 107361 transitions. [2019-09-08 10:11:39,121 INFO L78 Accepts]: Start accepts. Automaton has 68636 states and 107361 transitions. Word has length 485 [2019-09-08 10:11:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:39,122 INFO L475 AbstractCegarLoop]: Abstraction has 68636 states and 107361 transitions. [2019-09-08 10:11:39,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:11:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 68636 states and 107361 transitions. [2019-09-08 10:11:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-08 10:11:39,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:39,180 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] [2019-09-08 10:11:39,180 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1990395407, now seen corresponding path program 1 times [2019-09-08 10:11:39,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:39,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:39,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:39,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:39,668 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:39,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:39,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:39,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:39,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:39,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:39,672 INFO L87 Difference]: Start difference. First operand 68636 states and 107361 transitions. Second operand 3 states. [2019-09-08 10:11:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:11:47,793 INFO L93 Difference]: Finished difference Result 199363 states and 310736 transitions. [2019-09-08 10:11:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:11:47,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-08 10:11:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:11:47,948 INFO L225 Difference]: With dead ends: 199363 [2019-09-08 10:11:47,948 INFO L226 Difference]: Without dead ends: 134295 [2019-09-08 10:11:48,012 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:11:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134295 states. [2019-09-08 10:11:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134295 to 134255. [2019-09-08 10:11:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134255 states. [2019-09-08 10:11:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134255 states to 134255 states and 208781 transitions. [2019-09-08 10:11:56,888 INFO L78 Accepts]: Start accepts. Automaton has 134255 states and 208781 transitions. Word has length 487 [2019-09-08 10:11:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:56,889 INFO L475 AbstractCegarLoop]: Abstraction has 134255 states and 208781 transitions. [2019-09-08 10:11:56,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:11:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 134255 states and 208781 transitions. [2019-09-08 10:11:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-08 10:11:57,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:57,001 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] [2019-09-08 10:11:57,001 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:57,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2035879528, now seen corresponding path program 1 times [2019-09-08 10:11:57,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:57,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:57,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:57,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:57,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:57,499 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:57,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:57,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:11:57,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:11:57,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:11:57,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:11:57,501 INFO L87 Difference]: Start difference. First operand 134255 states and 208781 transitions. Second operand 3 states. [2019-09-08 10:12:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:13,333 INFO L93 Difference]: Finished difference Result 394452 states and 612407 transitions. [2019-09-08 10:12:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:12:13,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 487 [2019-09-08 10:12:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:13,661 INFO L225 Difference]: With dead ends: 394452 [2019-09-08 10:12:13,662 INFO L226 Difference]: Without dead ends: 264211 [2019-09-08 10:12:13,783 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:12:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264211 states. [2019-09-08 10:12:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264211 to 264173. [2019-09-08 10:12:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264173 states. [2019-09-08 10:12:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264173 states to 264173 states and 408927 transitions. [2019-09-08 10:12:32,289 INFO L78 Accepts]: Start accepts. Automaton has 264173 states and 408927 transitions. Word has length 487 [2019-09-08 10:12:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:12:32,289 INFO L475 AbstractCegarLoop]: Abstraction has 264173 states and 408927 transitions. [2019-09-08 10:12:32,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:12:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 264173 states and 408927 transitions. [2019-09-08 10:12:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-09-08 10:12:32,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:12:32,514 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] [2019-09-08 10:12:32,515 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:12:32,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:12:32,515 INFO L82 PathProgramCache]: Analyzing trace with hash 316687101, now seen corresponding path program 1 times [2019-09-08 10:12:32,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:12:32,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:12:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:32,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:12:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:12:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:12:33,043 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:12:33,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:12:33,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:12:33,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:12:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:12:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:12:33,046 INFO L87 Difference]: Start difference. First operand 264173 states and 408927 transitions. Second operand 3 states. [2019-09-08 10:13:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:04,745 INFO L93 Difference]: Finished difference Result 771725 states and 1191572 transitions. [2019-09-08 10:13:04,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:04,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 489 [2019-09-08 10:13:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:05,405 INFO L225 Difference]: With dead ends: 771725 [2019-09-08 10:13:05,405 INFO L226 Difference]: Without dead ends: 519228 [2019-09-08 10:13:06,225 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:13:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519228 states. [2019-09-08 10:13:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519228 to 519192. [2019-09-08 10:13:46,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519192 states. [2019-09-08 10:13:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519192 states to 519192 states and 799502 transitions. [2019-09-08 10:13:47,607 INFO L78 Accepts]: Start accepts. Automaton has 519192 states and 799502 transitions. Word has length 489 [2019-09-08 10:13:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:47,607 INFO L475 AbstractCegarLoop]: Abstraction has 519192 states and 799502 transitions. [2019-09-08 10:13:47,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 519192 states and 799502 transitions. [2019-09-08 10:13:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-09-08 10:13:48,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:48,082 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] [2019-09-08 10:13:48,082 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:48,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1681385152, now seen corresponding path program 1 times [2019-09-08 10:13:48,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:48,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:48,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:48,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:48,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:49,864 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:49,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:49,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:13:49,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:13:49,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:13:49,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:13:49,867 INFO L87 Difference]: Start difference. First operand 519192 states and 799502 transitions. Second operand 4 states. [2019-09-08 10:15:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:00,192 INFO L93 Difference]: Finished difference Result 1444159 states and 2214780 transitions. [2019-09-08 10:15:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:15:00,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 489 [2019-09-08 10:15:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:01,519 INFO L225 Difference]: With dead ends: 1444159 [2019-09-08 10:15:01,520 INFO L226 Difference]: Without dead ends: 964270 [2019-09-08 10:15:01,928 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:15:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964270 states. [2019-09-08 10:15:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964270 to 533556. [2019-09-08 10:15:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533556 states. [2019-09-08 10:15:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533556 states to 533556 states and 825063 transitions. [2019-09-08 10:15:57,314 INFO L78 Accepts]: Start accepts. Automaton has 533556 states and 825063 transitions. Word has length 489 [2019-09-08 10:15:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:57,315 INFO L475 AbstractCegarLoop]: Abstraction has 533556 states and 825063 transitions. [2019-09-08 10:15:57,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:15:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 533556 states and 825063 transitions. [2019-09-08 10:15:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-08 10:15:57,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:57,816 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, 1, 1, 1] [2019-09-08 10:15:57,816 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash 668997163, now seen corresponding path program 1 times [2019-09-08 10:15:57,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:57,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:57,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:58,404 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:15:58,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:58,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:15:58,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:15:58,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:15:58,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:15:58,406 INFO L87 Difference]: Start difference. First operand 533556 states and 825063 transitions. Second operand 4 states. [2019-09-08 10:17:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:22,578 INFO L93 Difference]: Finished difference Result 1373289 states and 2099859 transitions. [2019-09-08 10:17:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:17:22,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 493 [2019-09-08 10:17:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:23,896 INFO L225 Difference]: With dead ends: 1373289 [2019-09-08 10:17:23,896 INFO L226 Difference]: Without dead ends: 960472 [2019-09-08 10:17:24,224 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:17:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960472 states. [2019-09-08 10:18:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960472 to 579945. [2019-09-08 10:18:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579945 states. [2019-09-08 10:18:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579945 states to 579945 states and 903165 transitions. [2019-09-08 10:18:29,948 INFO L78 Accepts]: Start accepts. Automaton has 579945 states and 903165 transitions. Word has length 493 [2019-09-08 10:18:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:29,948 INFO L475 AbstractCegarLoop]: Abstraction has 579945 states and 903165 transitions. [2019-09-08 10:18:29,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:18:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 579945 states and 903165 transitions. [2019-09-08 10:18:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 10:18:30,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:30,537 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, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:30,537 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:30,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:30,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1605487766, now seen corresponding path program 1 times [2019-09-08 10:18:30,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:30,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:30,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:30,838 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:18:30,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:30,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:30,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:30,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:30,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:30,841 INFO L87 Difference]: Start difference. First operand 579945 states and 903165 transitions. Second operand 3 states. [2019-09-08 10:19:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:53,636 INFO L93 Difference]: Finished difference Result 1494081 states and 2317237 transitions. [2019-09-08 10:19:53,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:53,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-08 10:19:53,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:55,134 INFO L225 Difference]: With dead ends: 1494081 [2019-09-08 10:19:55,135 INFO L226 Difference]: Without dead ends: 1036700 [2019-09-08 10:19:55,545 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:19:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036700 states. [2019-09-08 10:21:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036700 to 593484. [2019-09-08 10:21:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593484 states. [2019-09-08 10:21:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593484 states to 593484 states and 920756 transitions. [2019-09-08 10:21:06,310 INFO L78 Accepts]: Start accepts. Automaton has 593484 states and 920756 transitions. Word has length 496 [2019-09-08 10:21:06,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:21:06,310 INFO L475 AbstractCegarLoop]: Abstraction has 593484 states and 920756 transitions. [2019-09-08 10:21:06,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:21:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 593484 states and 920756 transitions. [2019-09-08 10:21:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 10:21:08,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:21:08,417 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, 1, 1, 1, 1, 1, 1] [2019-09-08 10:21:08,417 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:21:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:21:08,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1769549823, now seen corresponding path program 1 times [2019-09-08 10:21:08,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:21:08,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:21:08,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:08,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:21:08,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:21:08,697 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:21:08,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:21:08,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:21:08,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:21:08,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:21:08,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:21:08,699 INFO L87 Difference]: Start difference. First operand 593484 states and 920756 transitions. Second operand 3 states.