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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:18:42,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:18:42,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:18:42,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:18:42,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:18:42,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:18:42,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:18:42,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:18:42,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:18:42,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:18:42,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:18:42,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:18:42,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:18:42,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:18:42,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:18:42,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:18:42,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:18:42,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:18:42,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:18:42,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:18:42,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:18:42,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:18:42,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:18:42,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:18:42,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:18:42,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:18:42,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:18:42,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:18:42,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:18:42,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:18:42,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:18:42,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:18:42,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:18:42,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:18:42,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:18:42,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:18:42,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:18:42,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:18:42,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:18:42,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:18:42,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:18:42,521 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 13:18:42,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:18:42,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:18:42,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:18:42,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:18:42,543 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:18:42,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:18:42,544 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:18:42,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:18:42,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:18:42,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:18:42,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:18:42,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:18:42,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:18:42,545 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:18:42,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:18:42,546 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:18:42,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:18:42,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:18:42,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:18:42,546 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:18:42,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:18:42,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:18:42,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:18:42,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:18:42,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:18:42,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:18:42,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:18:42,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:18:42,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:18:42,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:18:42,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:18:42,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:18:42,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:18:42,602 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:18:42,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:18:42,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f94c8a81/120e129cde6c4164a4021ae67a827b9f/FLAGae5f0b868 [2019-09-08 13:18:43,328 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:18:43,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:18:43,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f94c8a81/120e129cde6c4164a4021ae67a827b9f/FLAGae5f0b868 [2019-09-08 13:18:43,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f94c8a81/120e129cde6c4164a4021ae67a827b9f [2019-09-08 13:18:43,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:18:43,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:18:43,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:18:43,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:18:43,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:18:43,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:18:43" (1/1) ... [2019-09-08 13:18:43,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f35a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:43, skipping insertion in model container [2019-09-08 13:18:43,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:18:43" (1/1) ... [2019-09-08 13:18:43,528 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:18:43,696 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:18:45,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:18:45,134 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:18:46,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:18:46,659 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:18:46,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46 WrapperNode [2019-09-08 13:18:46,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:18:46,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:18:46,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:18:46,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:18:46,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46" (1/1) ... [2019-09-08 13:18:46,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46" (1/1) ... [2019-09-08 13:18:46,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46" (1/1) ... [2019-09-08 13:18:46,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46" (1/1) ... [2019-09-08 13:18:46,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46" (1/1) ... [2019-09-08 13:18:46,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46" (1/1) ... [2019-09-08 13:18:46,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46" (1/1) ... [2019-09-08 13:18:46,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:18:46,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:18:46,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:18:46,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:18:46,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46" (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 13:18:46,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:18:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:18:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:18:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:18:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:18:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:18:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:18:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:18:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:18:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:18:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:18:46,999 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:18:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:18:47,000 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:18:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:18:47,001 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:18:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:18:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:18:47,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:18:47,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:18:50,543 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:18:50,545 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:18:50,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:18:50 BoogieIcfgContainer [2019-09-08 13:18:50,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:18:50,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:18:50,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:18:50,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:18:50,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:18:43" (1/3) ... [2019-09-08 13:18:50,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a7a145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:18:50, skipping insertion in model container [2019-09-08 13:18:50,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:46" (2/3) ... [2019-09-08 13:18:50,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a7a145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:18:50, skipping insertion in model container [2019-09-08 13:18:50,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:18:50" (3/3) ... [2019-09-08 13:18:50,564 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:18:50,575 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:18:50,598 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 13:18:50,615 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 13:18:50,655 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:18:50,656 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:18:50,656 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:18:50,656 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:18:50,657 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:18:50,657 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:18:50,657 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:18:50,657 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:18:50,657 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:18:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states. [2019-09-08 13:18:50,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:50,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:50,776 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] [2019-09-08 13:18:50,778 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:50,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2079914003, now seen corresponding path program 1 times [2019-09-08 13:18:50,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:50,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:50,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:51,754 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 13:18:51,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:51,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:51,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:51,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:51,778 INFO L87 Difference]: Start difference. First operand 1016 states. Second operand 3 states. [2019-09-08 13:18:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:52,227 INFO L93 Difference]: Finished difference Result 1753 states and 3097 transitions. [2019-09-08 13:18:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:52,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:18:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:52,269 INFO L225 Difference]: With dead ends: 1753 [2019-09-08 13:18:52,269 INFO L226 Difference]: Without dead ends: 1469 [2019-09-08 13:18:52,280 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 13:18:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-09-08 13:18:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1467. [2019-09-08 13:18:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2019-09-08 13:18:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2247 transitions. [2019-09-08 13:18:52,417 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2247 transitions. Word has length 324 [2019-09-08 13:18:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:52,418 INFO L475 AbstractCegarLoop]: Abstraction has 1467 states and 2247 transitions. [2019-09-08 13:18:52,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2247 transitions. [2019-09-08 13:18:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:52,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:52,428 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] [2019-09-08 13:18:52,428 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1212724027, now seen corresponding path program 1 times [2019-09-08 13:18:52,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:52,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:52,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:52,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:52,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:52,797 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 13:18:52,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:52,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:52,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:52,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:52,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:52,803 INFO L87 Difference]: Start difference. First operand 1467 states and 2247 transitions. Second operand 3 states. [2019-09-08 13:18:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:53,103 INFO L93 Difference]: Finished difference Result 2816 states and 4365 transitions. [2019-09-08 13:18:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:53,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:18:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:53,120 INFO L225 Difference]: With dead ends: 2816 [2019-09-08 13:18:53,120 INFO L226 Difference]: Without dead ends: 2381 [2019-09-08 13:18:53,125 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 13:18:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2019-09-08 13:18:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2379. [2019-09-08 13:18:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2019-09-08 13:18:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3665 transitions. [2019-09-08 13:18:53,278 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3665 transitions. Word has length 324 [2019-09-08 13:18:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:53,280 INFO L475 AbstractCegarLoop]: Abstraction has 2379 states and 3665 transitions. [2019-09-08 13:18:53,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3665 transitions. [2019-09-08 13:18:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:53,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:53,290 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] [2019-09-08 13:18:53,290 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:53,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:53,291 INFO L82 PathProgramCache]: Analyzing trace with hash 813423402, now seen corresponding path program 1 times [2019-09-08 13:18:53,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:53,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:53,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:53,674 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 13:18:53,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:53,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:53,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:53,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:53,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:53,677 INFO L87 Difference]: Start difference. First operand 2379 states and 3665 transitions. Second operand 3 states. [2019-09-08 13:18:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:54,059 INFO L93 Difference]: Finished difference Result 4930 states and 7694 transitions. [2019-09-08 13:18:54,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:54,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:18:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:54,081 INFO L225 Difference]: With dead ends: 4930 [2019-09-08 13:18:54,081 INFO L226 Difference]: Without dead ends: 4257 [2019-09-08 13:18:54,085 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 13:18:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2019-09-08 13:18:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 4255. [2019-09-08 13:18:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4255 states. [2019-09-08 13:18:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 6581 transitions. [2019-09-08 13:18:54,260 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 6581 transitions. Word has length 324 [2019-09-08 13:18:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:54,261 INFO L475 AbstractCegarLoop]: Abstraction has 4255 states and 6581 transitions. [2019-09-08 13:18:54,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 6581 transitions. [2019-09-08 13:18:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:54,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:54,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:54,273 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:54,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash 813084778, now seen corresponding path program 1 times [2019-09-08 13:18:54,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:54,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:54,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:54,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:55,265 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 13:18:55,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:55,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:55,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:55,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:55,268 INFO L87 Difference]: Start difference. First operand 4255 states and 6581 transitions. Second operand 4 states. [2019-09-08 13:18:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:55,777 INFO L93 Difference]: Finished difference Result 12582 states and 19440 transitions. [2019-09-08 13:18:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:18:55,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 13:18:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:55,819 INFO L225 Difference]: With dead ends: 12582 [2019-09-08 13:18:55,819 INFO L226 Difference]: Without dead ends: 8342 [2019-09-08 13:18:55,831 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 13:18:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8342 states. [2019-09-08 13:18:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8342 to 8171. [2019-09-08 13:18:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8171 states. [2019-09-08 13:18:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 12600 transitions. [2019-09-08 13:18:56,174 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 12600 transitions. Word has length 324 [2019-09-08 13:18:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:56,174 INFO L475 AbstractCegarLoop]: Abstraction has 8171 states and 12600 transitions. [2019-09-08 13:18:56,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:18:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 12600 transitions. [2019-09-08 13:18:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:18:56,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:56,196 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] [2019-09-08 13:18:56,197 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:56,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:56,197 INFO L82 PathProgramCache]: Analyzing trace with hash -47582525, now seen corresponding path program 1 times [2019-09-08 13:18:56,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:56,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:56,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:56,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:56,365 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 13:18:56,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:56,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:56,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:56,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:56,368 INFO L87 Difference]: Start difference. First operand 8171 states and 12600 transitions. Second operand 3 states. [2019-09-08 13:18:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:56,863 INFO L93 Difference]: Finished difference Result 24468 states and 37729 transitions. [2019-09-08 13:18:56,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:56,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:18:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:56,932 INFO L225 Difference]: With dead ends: 24468 [2019-09-08 13:18:56,932 INFO L226 Difference]: Without dead ends: 16322 [2019-09-08 13:18:56,951 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 13:18:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16322 states. [2019-09-08 13:18:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16322 to 8184. [2019-09-08 13:18:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8184 states. [2019-09-08 13:18:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8184 states to 8184 states and 12619 transitions. [2019-09-08 13:18:57,412 INFO L78 Accepts]: Start accepts. Automaton has 8184 states and 12619 transitions. Word has length 326 [2019-09-08 13:18:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:57,413 INFO L475 AbstractCegarLoop]: Abstraction has 8184 states and 12619 transitions. [2019-09-08 13:18:57,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 8184 states and 12619 transitions. [2019-09-08 13:18:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:18:57,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:57,434 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] [2019-09-08 13:18:57,435 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2014553918, now seen corresponding path program 1 times [2019-09-08 13:18:57,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:57,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:57,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:57,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:57,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:57,796 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 13:18:57,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:57,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:57,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:57,799 INFO L87 Difference]: Start difference. First operand 8184 states and 12619 transitions. Second operand 3 states. [2019-09-08 13:18:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:58,445 INFO L93 Difference]: Finished difference Result 24081 states and 37064 transitions. [2019-09-08 13:18:58,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:58,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:18:58,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:58,486 INFO L225 Difference]: With dead ends: 24081 [2019-09-08 13:18:58,487 INFO L226 Difference]: Without dead ends: 16039 [2019-09-08 13:18:58,509 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 13:18:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16039 states. [2019-09-08 13:18:59,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16039 to 15868. [2019-09-08 13:18:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15868 states. [2019-09-08 13:18:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15868 states to 15868 states and 24357 transitions. [2019-09-08 13:18:59,868 INFO L78 Accepts]: Start accepts. Automaton has 15868 states and 24357 transitions. Word has length 326 [2019-09-08 13:18:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:59,869 INFO L475 AbstractCegarLoop]: Abstraction has 15868 states and 24357 transitions. [2019-09-08 13:18:59,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15868 states and 24357 transitions. [2019-09-08 13:18:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:18:59,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:59,905 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] [2019-09-08 13:18:59,906 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:59,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:59,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1271718060, now seen corresponding path program 1 times [2019-09-08 13:18:59,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:59,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:59,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:59,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:59,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:00,071 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 13:19:00,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:00,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:00,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:00,074 INFO L87 Difference]: Start difference. First operand 15868 states and 24357 transitions. Second operand 3 states. [2019-09-08 13:19:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:00,944 INFO L93 Difference]: Finished difference Result 47491 states and 72884 transitions. [2019-09-08 13:19:00,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:00,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 13:19:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:01,027 INFO L225 Difference]: With dead ends: 47491 [2019-09-08 13:19:01,027 INFO L226 Difference]: Without dead ends: 31683 [2019-09-08 13:19:01,077 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 13:19:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31683 states. [2019-09-08 13:19:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31683 to 15886. [2019-09-08 13:19:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15886 states. [2019-09-08 13:19:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 24378 transitions. [2019-09-08 13:19:01,975 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 24378 transitions. Word has length 327 [2019-09-08 13:19:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:01,975 INFO L475 AbstractCegarLoop]: Abstraction has 15886 states and 24378 transitions. [2019-09-08 13:19:01,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 24378 transitions. [2019-09-08 13:19:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:19:02,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:02,011 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] [2019-09-08 13:19:02,011 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:02,012 INFO L82 PathProgramCache]: Analyzing trace with hash -720506535, now seen corresponding path program 1 times [2019-09-08 13:19:02,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:02,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:02,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:02,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:02,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:02,314 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 13:19:02,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:02,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:02,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:02,316 INFO L87 Difference]: Start difference. First operand 15886 states and 24378 transitions. Second operand 3 states. [2019-09-08 13:19:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:03,418 INFO L93 Difference]: Finished difference Result 44974 states and 68867 transitions. [2019-09-08 13:19:03,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:03,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 13:19:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:03,554 INFO L225 Difference]: With dead ends: 44974 [2019-09-08 13:19:03,554 INFO L226 Difference]: Without dead ends: 29333 [2019-09-08 13:19:03,605 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 13:19:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29333 states. [2019-09-08 13:19:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29333 to 29162. [2019-09-08 13:19:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29162 states. [2019-09-08 13:19:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29162 states to 29162 states and 44462 transitions. [2019-09-08 13:19:05,022 INFO L78 Accepts]: Start accepts. Automaton has 29162 states and 44462 transitions. Word has length 328 [2019-09-08 13:19:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:05,023 INFO L475 AbstractCegarLoop]: Abstraction has 29162 states and 44462 transitions. [2019-09-08 13:19:05,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 29162 states and 44462 transitions. [2019-09-08 13:19:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:19:05,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:05,075 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] [2019-09-08 13:19:05,076 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1085513782, now seen corresponding path program 1 times [2019-09-08 13:19:05,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:05,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:05,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:05,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:05,442 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 13:19:05,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:05,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:19:05,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:19:05,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:19:05,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:19:05,444 INFO L87 Difference]: Start difference. First operand 29162 states and 44462 transitions. Second operand 4 states. [2019-09-08 13:19:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:07,420 INFO L93 Difference]: Finished difference Result 84742 states and 128998 transitions. [2019-09-08 13:19:07,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:19:07,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 13:19:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:07,548 INFO L225 Difference]: With dead ends: 84742 [2019-09-08 13:19:07,549 INFO L226 Difference]: Without dead ends: 56120 [2019-09-08 13:19:07,614 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 13:19:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56120 states. [2019-09-08 13:19:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56120 to 29397. [2019-09-08 13:19:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29397 states. [2019-09-08 13:19:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29397 states to 29397 states and 44850 transitions. [2019-09-08 13:19:08,979 INFO L78 Accepts]: Start accepts. Automaton has 29397 states and 44850 transitions. Word has length 328 [2019-09-08 13:19:08,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:08,979 INFO L475 AbstractCegarLoop]: Abstraction has 29397 states and 44850 transitions. [2019-09-08 13:19:08,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:19:08,980 INFO L276 IsEmpty]: Start isEmpty. Operand 29397 states and 44850 transitions. [2019-09-08 13:19:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:19:09,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:09,007 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] [2019-09-08 13:19:09,008 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:09,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1858070503, now seen corresponding path program 1 times [2019-09-08 13:19:09,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:09,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:09,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:09,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:09,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:09,184 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 13:19:09,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:09,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:09,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:09,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:09,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:09,186 INFO L87 Difference]: Start difference. First operand 29397 states and 44850 transitions. Second operand 3 states. [2019-09-08 13:19:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:10,769 INFO L93 Difference]: Finished difference Result 74877 states and 115068 transitions. [2019-09-08 13:19:10,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:10,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:19:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:10,879 INFO L225 Difference]: With dead ends: 74877 [2019-09-08 13:19:10,879 INFO L226 Difference]: Without dead ends: 47235 [2019-09-08 13:19:10,938 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 13:19:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47235 states. [2019-09-08 13:19:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47235 to 37053. [2019-09-08 13:19:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37053 states. [2019-09-08 13:19:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37053 states to 37053 states and 57444 transitions. [2019-09-08 13:19:13,455 INFO L78 Accepts]: Start accepts. Automaton has 37053 states and 57444 transitions. Word has length 330 [2019-09-08 13:19:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:13,456 INFO L475 AbstractCegarLoop]: Abstraction has 37053 states and 57444 transitions. [2019-09-08 13:19:13,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 37053 states and 57444 transitions. [2019-09-08 13:19:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:19:13,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:13,483 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] [2019-09-08 13:19:13,484 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1930508395, now seen corresponding path program 1 times [2019-09-08 13:19:13,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:13,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:13,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:13,638 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 13:19:13,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:13,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:13,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:13,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:13,640 INFO L87 Difference]: Start difference. First operand 37053 states and 57444 transitions. Second operand 3 states. [2019-09-08 13:19:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:16,759 INFO L93 Difference]: Finished difference Result 109589 states and 169613 transitions. [2019-09-08 13:19:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:16,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:19:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:16,895 INFO L225 Difference]: With dead ends: 109589 [2019-09-08 13:19:16,895 INFO L226 Difference]: Without dead ends: 73339 [2019-09-08 13:19:16,957 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 13:19:17,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73339 states. [2019-09-08 13:19:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73339 to 37157. [2019-09-08 13:19:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37157 states. [2019-09-08 13:19:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37157 states to 37157 states and 57587 transitions. [2019-09-08 13:19:18,622 INFO L78 Accepts]: Start accepts. Automaton has 37157 states and 57587 transitions. Word has length 330 [2019-09-08 13:19:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:18,622 INFO L475 AbstractCegarLoop]: Abstraction has 37157 states and 57587 transitions. [2019-09-08 13:19:18,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 37157 states and 57587 transitions. [2019-09-08 13:19:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:19:18,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:18,651 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] [2019-09-08 13:19:18,651 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:18,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash 294622740, now seen corresponding path program 1 times [2019-09-08 13:19:18,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:18,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:18,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:18,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:18,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:18,815 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 13:19:18,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:18,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:18,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:18,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:18,818 INFO L87 Difference]: Start difference. First operand 37157 states and 57587 transitions. Second operand 3 states. [2019-09-08 13:19:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:22,023 INFO L93 Difference]: Finished difference Result 109721 states and 169779 transitions. [2019-09-08 13:19:22,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:22,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 13:19:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:22,139 INFO L225 Difference]: With dead ends: 109721 [2019-09-08 13:19:22,139 INFO L226 Difference]: Without dead ends: 73464 [2019-09-08 13:19:22,199 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 13:19:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73464 states. [2019-09-08 13:19:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73464 to 37282. [2019-09-08 13:19:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37282 states. [2019-09-08 13:19:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37282 states to 37282 states and 57733 transitions. [2019-09-08 13:19:23,876 INFO L78 Accepts]: Start accepts. Automaton has 37282 states and 57733 transitions. Word has length 331 [2019-09-08 13:19:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:23,876 INFO L475 AbstractCegarLoop]: Abstraction has 37282 states and 57733 transitions. [2019-09-08 13:19:23,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 37282 states and 57733 transitions. [2019-09-08 13:19:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:19:23,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:23,905 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] [2019-09-08 13:19:23,906 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:23,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1498157719, now seen corresponding path program 1 times [2019-09-08 13:19:23,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:23,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:23,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:23,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:23,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:24,415 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 13:19:24,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:24,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:19:24,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:19:24,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:19:24,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:19:24,417 INFO L87 Difference]: Start difference. First operand 37282 states and 57733 transitions. Second operand 3 states. [2019-09-08 13:19:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:26,666 INFO L93 Difference]: Finished difference Result 94086 states and 146775 transitions. [2019-09-08 13:19:26,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:19:26,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:19:26,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:26,742 INFO L225 Difference]: With dead ends: 94086 [2019-09-08 13:19:26,743 INFO L226 Difference]: Without dead ends: 59100 [2019-09-08 13:19:26,802 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 13:19:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59100 states. [2019-09-08 13:19:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59100 to 50954. [2019-09-08 13:19:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50954 states. [2019-09-08 13:19:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50954 states to 50954 states and 80083 transitions. [2019-09-08 13:19:30,210 INFO L78 Accepts]: Start accepts. Automaton has 50954 states and 80083 transitions. Word has length 332 [2019-09-08 13:19:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:30,211 INFO L475 AbstractCegarLoop]: Abstraction has 50954 states and 80083 transitions. [2019-09-08 13:19:30,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:19:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 50954 states and 80083 transitions. [2019-09-08 13:19:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:19:30,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:30,232 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] [2019-09-08 13:19:30,232 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:30,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:30,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2084302370, now seen corresponding path program 1 times [2019-09-08 13:19:30,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:30,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:30,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:30,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:30,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:30,613 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 13:19:30,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:30,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:19:30,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:19:30,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:19:30,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:19:30,616 INFO L87 Difference]: Start difference. First operand 50954 states and 80083 transitions. Second operand 4 states. [2019-09-08 13:19:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:32,991 INFO L93 Difference]: Finished difference Result 97762 states and 153528 transitions. [2019-09-08 13:19:32,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:19:32,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-08 13:19:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:33,048 INFO L225 Difference]: With dead ends: 97762 [2019-09-08 13:19:33,049 INFO L226 Difference]: Without dead ends: 47671 [2019-09-08 13:19:33,095 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 13:19:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47671 states. [2019-09-08 13:19:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47671 to 47651. [2019-09-08 13:19:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47651 states. [2019-09-08 13:19:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47651 states to 47651 states and 74862 transitions. [2019-09-08 13:19:35,445 INFO L78 Accepts]: Start accepts. Automaton has 47651 states and 74862 transitions. Word has length 332 [2019-09-08 13:19:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:35,446 INFO L475 AbstractCegarLoop]: Abstraction has 47651 states and 74862 transitions. [2019-09-08 13:19:35,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:19:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 47651 states and 74862 transitions. [2019-09-08 13:19:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:19:35,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:35,463 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] [2019-09-08 13:19:35,463 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:35,464 INFO L82 PathProgramCache]: Analyzing trace with hash 10678946, now seen corresponding path program 1 times [2019-09-08 13:19:35,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:35,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:35,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:35,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:35,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:35,801 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 13:19:35,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:35,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:19:35,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:19:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:19:35,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:19:35,804 INFO L87 Difference]: Start difference. First operand 47651 states and 74862 transitions. Second operand 9 states. [2019-09-08 13:19:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:58,411 INFO L93 Difference]: Finished difference Result 359084 states and 570276 transitions. [2019-09-08 13:19:58,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 13:19:58,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 333 [2019-09-08 13:19:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:58,882 INFO L225 Difference]: With dead ends: 359084 [2019-09-08 13:19:58,882 INFO L226 Difference]: Without dead ends: 339851 [2019-09-08 13:19:58,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 13:19:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339851 states. [2019-09-08 13:20:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339851 to 145833. [2019-09-08 13:20:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145833 states. [2019-09-08 13:20:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145833 states to 145833 states and 229434 transitions. [2019-09-08 13:20:11,203 INFO L78 Accepts]: Start accepts. Automaton has 145833 states and 229434 transitions. Word has length 333 [2019-09-08 13:20:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:11,203 INFO L475 AbstractCegarLoop]: Abstraction has 145833 states and 229434 transitions. [2019-09-08 13:20:11,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:20:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 145833 states and 229434 transitions. [2019-09-08 13:20:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:20:11,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:11,257 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] [2019-09-08 13:20:11,257 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:11,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash -435112094, now seen corresponding path program 1 times [2019-09-08 13:20:11,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:11,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:11,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:11,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:11,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:14,001 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 13:20:14,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:14,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 13:20:14,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 13:20:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 13:20:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:20:14,005 INFO L87 Difference]: Start difference. First operand 145833 states and 229434 transitions. Second operand 10 states. [2019-09-08 13:20:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:34,545 INFO L93 Difference]: Finished difference Result 381517 states and 608871 transitions. [2019-09-08 13:20:34,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:20:34,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 333 [2019-09-08 13:20:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:35,038 INFO L225 Difference]: With dead ends: 381517 [2019-09-08 13:20:35,038 INFO L226 Difference]: Without dead ends: 296660 [2019-09-08 13:20:35,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-08 13:20:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296660 states. [2019-09-08 13:20:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296660 to 106318. [2019-09-08 13:20:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106318 states. [2019-09-08 13:20:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106318 states to 106318 states and 166321 transitions. [2019-09-08 13:20:47,423 INFO L78 Accepts]: Start accepts. Automaton has 106318 states and 166321 transitions. Word has length 333 [2019-09-08 13:20:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:47,424 INFO L475 AbstractCegarLoop]: Abstraction has 106318 states and 166321 transitions. [2019-09-08 13:20:47,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 13:20:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 106318 states and 166321 transitions. [2019-09-08 13:20:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:20:47,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:47,454 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] [2019-09-08 13:20:47,455 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:47,455 INFO L82 PathProgramCache]: Analyzing trace with hash -729000614, now seen corresponding path program 1 times [2019-09-08 13:20:47,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:47,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:47,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:47,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 13:20:47,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:47,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:47,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:47,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:47,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:47,972 INFO L87 Difference]: Start difference. First operand 106318 states and 166321 transitions. Second operand 4 states. [2019-09-08 13:21:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:05,702 INFO L93 Difference]: Finished difference Result 313867 states and 491021 transitions. [2019-09-08 13:21:05,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:21:05,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-09-08 13:21:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:06,023 INFO L225 Difference]: With dead ends: 313867 [2019-09-08 13:21:06,023 INFO L226 Difference]: Without dead ends: 207621 [2019-09-08 13:21:06,103 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 13:21:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207621 states. [2019-09-08 13:21:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207621 to 207464. [2019-09-08 13:21:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207464 states. [2019-09-08 13:21:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207464 states to 207464 states and 323227 transitions. [2019-09-08 13:21:20,206 INFO L78 Accepts]: Start accepts. Automaton has 207464 states and 323227 transitions. Word has length 333 [2019-09-08 13:21:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:20,207 INFO L475 AbstractCegarLoop]: Abstraction has 207464 states and 323227 transitions. [2019-09-08 13:21:20,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:21:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 207464 states and 323227 transitions. [2019-09-08 13:21:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 13:21:20,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:20,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:21:20,272 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:20,273 INFO L82 PathProgramCache]: Analyzing trace with hash 819018217, now seen corresponding path program 1 times [2019-09-08 13:21:20,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:20,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:20,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:20,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:20,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:20,493 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 13:21:20,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:20,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:20,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:20,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:20,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:20,495 INFO L87 Difference]: Start difference. First operand 207464 states and 323227 transitions. Second operand 3 states. [2019-09-08 13:21:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:51,880 INFO L93 Difference]: Finished difference Result 612980 states and 955351 transitions. [2019-09-08 13:21:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:51,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-08 13:21:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:52,529 INFO L225 Difference]: With dead ends: 612980 [2019-09-08 13:21:52,529 INFO L226 Difference]: Without dead ends: 406765 [2019-09-08 13:21:52,732 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 13:21:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406765 states. [2019-09-08 13:22:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406765 to 406612. [2019-09-08 13:22:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406612 states. [2019-09-08 13:22:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406612 states to 406612 states and 631672 transitions. [2019-09-08 13:22:31,588 INFO L78 Accepts]: Start accepts. Automaton has 406612 states and 631672 transitions. Word has length 335 [2019-09-08 13:22:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:31,589 INFO L475 AbstractCegarLoop]: Abstraction has 406612 states and 631672 transitions. [2019-09-08 13:22:31,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:22:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 406612 states and 631672 transitions. [2019-09-08 13:22:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:22:31,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:31,723 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] [2019-09-08 13:22:31,723 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:31,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash 938770134, now seen corresponding path program 1 times [2019-09-08 13:22:31,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:31,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:31,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:31,948 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 13:22:31,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:31,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:31,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:31,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:31,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:31,952 INFO L87 Difference]: Start difference. First operand 406612 states and 631672 transitions. Second operand 3 states. [2019-09-08 13:23:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:23:35,143 INFO L93 Difference]: Finished difference Result 1095516 states and 1714779 transitions. [2019-09-08 13:23:35,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:23:35,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-08 13:23:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:23:36,242 INFO L225 Difference]: With dead ends: 1095516 [2019-09-08 13:23:36,243 INFO L226 Difference]: Without dead ends: 696065 [2019-09-08 13:23:36,534 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 13:23:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696065 states. [2019-09-08 13:24:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696065 to 633508. [2019-09-08 13:24:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633508 states. [2019-09-08 13:24:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633508 states to 633508 states and 991392 transitions. [2019-09-08 13:24:48,213 INFO L78 Accepts]: Start accepts. Automaton has 633508 states and 991392 transitions. Word has length 336 [2019-09-08 13:24:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:24:48,214 INFO L475 AbstractCegarLoop]: Abstraction has 633508 states and 991392 transitions. [2019-09-08 13:24:48,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:24:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 633508 states and 991392 transitions. [2019-09-08 13:24:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 13:24:48,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:24:48,353 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] [2019-09-08 13:24:48,353 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:24:48,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:24:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1433509614, now seen corresponding path program 1 times [2019-09-08 13:24:48,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:24:48,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:24:48,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:48,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:24:48,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:24:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:24:48,581 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 13:24:48,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:24:48,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:24:48,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:24:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:24:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:24:48,583 INFO L87 Difference]: Start difference. First operand 633508 states and 991392 transitions. Second operand 3 states. [2019-09-08 13:26:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:45,933 INFO L93 Difference]: Finished difference Result 1875961 states and 2935472 transitions. [2019-09-08 13:26:45,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:45,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-08 13:26:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:48,813 INFO L225 Difference]: With dead ends: 1875961 [2019-09-08 13:26:48,814 INFO L226 Difference]: Without dead ends: 1243800 [2019-09-08 13:26:49,400 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 13:26:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243800 states.