java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:40:32,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:40:32,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:40:32,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:40:32,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:40:32,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:40:32,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:40:32,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:40:32,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:40:32,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:40:32,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:40:32,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:40:32,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:40:32,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:40:32,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:40:32,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:40:32,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:40:32,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:40:32,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:40:32,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:40:32,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:40:32,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:40:32,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:40:32,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:40:32,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:40:32,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:40:32,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:40:32,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:40:32,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:40:32,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:40:32,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:40:32,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:40:32,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:40:32,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:40:32,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:40:32,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:40:32,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:40:32,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:40:32,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:40:32,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:40:32,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:40:32,473 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 09:40:32,487 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:40:32,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:40:32,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:40:32,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:40:32,489 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:40:32,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:40:32,489 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:40:32,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:40:32,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:40:32,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:40:32,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:40:32,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:40:32,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:40:32,491 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:40:32,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:40:32,491 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:40:32,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:40:32,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:40:32,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:40:32,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:40:32,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:40:32,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:40:32,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:40:32,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:40:32,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:40:32,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:40:32,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:40:32,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:40:32,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:40:32,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:40:32,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:40:32,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:40:32,538 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:40:32,538 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:40:32,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:40:32,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbd61454/f00e64d2e9494161937aa22e3816aaec/FLAG1b78320c8 [2019-09-08 09:40:33,239 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:40:33,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:40:33,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbd61454/f00e64d2e9494161937aa22e3816aaec/FLAG1b78320c8 [2019-09-08 09:40:33,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbd61454/f00e64d2e9494161937aa22e3816aaec [2019-09-08 09:40:33,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:40:33,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:40:33,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:40:33,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:40:33,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:40:33,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:40:33" (1/1) ... [2019-09-08 09:40:33,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b439c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:33, skipping insertion in model container [2019-09-08 09:40:33,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:40:33" (1/1) ... [2019-09-08 09:40:33,442 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:40:33,601 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:40:34,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:40:34,852 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:40:35,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:40:35,663 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:40:35,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35 WrapperNode [2019-09-08 09:40:35,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:40:35,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:40:35,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:40:35,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:40:35,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35" (1/1) ... [2019-09-08 09:40:35,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35" (1/1) ... [2019-09-08 09:40:35,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35" (1/1) ... [2019-09-08 09:40:35,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35" (1/1) ... [2019-09-08 09:40:35,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35" (1/1) ... [2019-09-08 09:40:35,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35" (1/1) ... [2019-09-08 09:40:35,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35" (1/1) ... [2019-09-08 09:40:35,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:40:35,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:40:35,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:40:35,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:40:35,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35" (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 09:40:35,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:40:35,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:40:35,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:40:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:40:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:40:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:40:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:40:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:40:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:40:35,952 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:40:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:40:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:40:35,953 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:40:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:40:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:40:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:40:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:40:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:40:35,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:40:38,677 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:40:38,677 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:40:38,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:40:38 BoogieIcfgContainer [2019-09-08 09:40:38,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:40:38,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:40:38,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:40:38,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:40:38,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:40:33" (1/3) ... [2019-09-08 09:40:38,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe178cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:40:38, skipping insertion in model container [2019-09-08 09:40:38,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:35" (2/3) ... [2019-09-08 09:40:38,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe178cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:40:38, skipping insertion in model container [2019-09-08 09:40:38,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:40:38" (3/3) ... [2019-09-08 09:40:38,687 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 09:40:38,697 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:40:38,706 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 09:40:38,723 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 09:40:38,772 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:40:38,772 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:40:38,773 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:40:38,773 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:40:38,773 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:40:38,773 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:40:38,773 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:40:38,773 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:40:38,774 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:40:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states. [2019-09-08 09:40:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-08 09:40:38,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:38,865 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] [2019-09-08 09:40:38,870 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:38,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash 131976985, now seen corresponding path program 1 times [2019-09-08 09:40:38,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:38,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:38,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:40,589 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 09:40:40,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:40,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:40,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:40,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:40,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:40,617 INFO L87 Difference]: Start difference. First operand 898 states. Second operand 4 states. [2019-09-08 09:40:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:40,955 INFO L93 Difference]: Finished difference Result 2645 states and 4765 transitions. [2019-09-08 09:40:40,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:40:40,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2019-09-08 09:40:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:40,995 INFO L225 Difference]: With dead ends: 2645 [2019-09-08 09:40:40,996 INFO L226 Difference]: Without dead ends: 1754 [2019-09-08 09:40:41,011 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 09:40:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2019-09-08 09:40:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1663. [2019-09-08 09:40:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2019-09-08 09:40:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2555 transitions. [2019-09-08 09:40:41,168 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2555 transitions. Word has length 290 [2019-09-08 09:40:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:41,171 INFO L475 AbstractCegarLoop]: Abstraction has 1663 states and 2555 transitions. [2019-09-08 09:40:41,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2555 transitions. [2019-09-08 09:40:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 09:40:41,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:41,186 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] [2019-09-08 09:40:41,186 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:41,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1362145513, now seen corresponding path program 1 times [2019-09-08 09:40:41,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:41,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:41,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:41,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:41,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:41,540 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 09:40:41,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:41,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:41,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:41,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:41,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:41,543 INFO L87 Difference]: Start difference. First operand 1663 states and 2555 transitions. Second operand 3 states. [2019-09-08 09:40:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:41,780 INFO L93 Difference]: Finished difference Result 4804 states and 7349 transitions. [2019-09-08 09:40:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:41,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-09-08 09:40:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:41,799 INFO L225 Difference]: With dead ends: 4804 [2019-09-08 09:40:41,800 INFO L226 Difference]: Without dead ends: 3270 [2019-09-08 09:40:41,804 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 09:40:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2019-09-08 09:40:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3179. [2019-09-08 09:40:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3179 states. [2019-09-08 09:40:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 4884 transitions. [2019-09-08 09:40:41,947 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 4884 transitions. Word has length 292 [2019-09-08 09:40:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:41,951 INFO L475 AbstractCegarLoop]: Abstraction has 3179 states and 4884 transitions. [2019-09-08 09:40:41,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 4884 transitions. [2019-09-08 09:40:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 09:40:41,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:41,961 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] [2019-09-08 09:40:41,962 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:41,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:41,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1870066724, now seen corresponding path program 1 times [2019-09-08 09:40:41,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:41,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:41,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:41,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:41,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:42,153 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 09:40:42,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:42,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:42,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:42,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:42,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:42,158 INFO L87 Difference]: Start difference. First operand 3179 states and 4884 transitions. Second operand 3 states. [2019-09-08 09:40:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:42,436 INFO L93 Difference]: Finished difference Result 9462 states and 14528 transitions. [2019-09-08 09:40:42,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:42,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-09-08 09:40:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:42,467 INFO L225 Difference]: With dead ends: 9462 [2019-09-08 09:40:42,467 INFO L226 Difference]: Without dead ends: 6325 [2019-09-08 09:40:42,474 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 09:40:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6325 states. [2019-09-08 09:40:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6325 to 3198. [2019-09-08 09:40:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2019-09-08 09:40:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4912 transitions. [2019-09-08 09:40:42,636 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4912 transitions. Word has length 292 [2019-09-08 09:40:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:42,636 INFO L475 AbstractCegarLoop]: Abstraction has 3198 states and 4912 transitions. [2019-09-08 09:40:42,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4912 transitions. [2019-09-08 09:40:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 09:40:42,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:42,645 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] [2019-09-08 09:40:42,646 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:42,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1528789777, now seen corresponding path program 1 times [2019-09-08 09:40:42,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:42,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:42,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:42,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:42,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:42,767 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 09:40:42,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:42,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:42,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:42,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:42,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:42,769 INFO L87 Difference]: Start difference. First operand 3198 states and 4912 transitions. Second operand 3 states. [2019-09-08 09:40:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:43,158 INFO L93 Difference]: Finished difference Result 9481 states and 14549 transitions. [2019-09-08 09:40:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:43,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-09-08 09:40:43,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:43,198 INFO L225 Difference]: With dead ends: 9481 [2019-09-08 09:40:43,198 INFO L226 Difference]: Without dead ends: 6343 [2019-09-08 09:40:43,214 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 09:40:43,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-09-08 09:40:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 3216. [2019-09-08 09:40:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3216 states. [2019-09-08 09:40:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 4933 transitions. [2019-09-08 09:40:43,553 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 4933 transitions. Word has length 293 [2019-09-08 09:40:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:43,554 INFO L475 AbstractCegarLoop]: Abstraction has 3216 states and 4933 transitions. [2019-09-08 09:40:43,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 4933 transitions. [2019-09-08 09:40:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 09:40:43,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:43,565 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] [2019-09-08 09:40:43,565 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:43,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1263048754, now seen corresponding path program 1 times [2019-09-08 09:40:43,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:43,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:43,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:43,781 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 09:40:43,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:43,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:43,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:43,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:43,783 INFO L87 Difference]: Start difference. First operand 3216 states and 4933 transitions. Second operand 3 states. [2019-09-08 09:40:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:44,174 INFO L93 Difference]: Finished difference Result 9201 states and 14048 transitions. [2019-09-08 09:40:44,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:44,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-09-08 09:40:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:44,206 INFO L225 Difference]: With dead ends: 9201 [2019-09-08 09:40:44,206 INFO L226 Difference]: Without dead ends: 6230 [2019-09-08 09:40:44,216 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 09:40:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2019-09-08 09:40:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 6139. [2019-09-08 09:40:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6139 states. [2019-09-08 09:40:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6139 states to 6139 states and 9373 transitions. [2019-09-08 09:40:44,670 INFO L78 Accepts]: Start accepts. Automaton has 6139 states and 9373 transitions. Word has length 294 [2019-09-08 09:40:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:44,671 INFO L475 AbstractCegarLoop]: Abstraction has 6139 states and 9373 transitions. [2019-09-08 09:40:44,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 6139 states and 9373 transitions. [2019-09-08 09:40:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 09:40:44,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:44,686 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] [2019-09-08 09:40:44,687 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash -448917937, now seen corresponding path program 1 times [2019-09-08 09:40:44,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:44,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:44,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:44,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:44,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:45,047 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 09:40:45,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:45,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:45,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:45,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:45,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:45,049 INFO L87 Difference]: Start difference. First operand 6139 states and 9373 transitions. Second operand 4 states. [2019-09-08 09:40:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:45,532 INFO L93 Difference]: Finished difference Result 16845 states and 25530 transitions. [2019-09-08 09:40:45,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:45,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2019-09-08 09:40:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:45,561 INFO L225 Difference]: With dead ends: 16845 [2019-09-08 09:40:45,561 INFO L226 Difference]: Without dead ends: 11246 [2019-09-08 09:40:45,576 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 09:40:45,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11246 states. [2019-09-08 09:40:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11246 to 6374. [2019-09-08 09:40:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6374 states. [2019-09-08 09:40:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6374 states to 6374 states and 9761 transitions. [2019-09-08 09:40:46,030 INFO L78 Accepts]: Start accepts. Automaton has 6374 states and 9761 transitions. Word has length 294 [2019-09-08 09:40:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:46,030 INFO L475 AbstractCegarLoop]: Abstraction has 6374 states and 9761 transitions. [2019-09-08 09:40:46,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6374 states and 9761 transitions. [2019-09-08 09:40:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-08 09:40:46,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:46,046 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] [2019-09-08 09:40:46,047 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:46,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:46,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1623899282, now seen corresponding path program 1 times [2019-09-08 09:40:46,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:46,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:46,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:46,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:46,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:46,178 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 09:40:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:46,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:46,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:46,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:46,180 INFO L87 Difference]: Start difference. First operand 6374 states and 9761 transitions. Second operand 3 states. [2019-09-08 09:40:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:46,698 INFO L93 Difference]: Finished difference Result 17552 states and 26564 transitions. [2019-09-08 09:40:46,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:46,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-09-08 09:40:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:46,728 INFO L225 Difference]: With dead ends: 17552 [2019-09-08 09:40:46,729 INFO L226 Difference]: Without dead ends: 11981 [2019-09-08 09:40:46,746 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 09:40:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2019-09-08 09:40:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 6478. [2019-09-08 09:40:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6478 states. [2019-09-08 09:40:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 9904 transitions. [2019-09-08 09:40:47,250 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 9904 transitions. Word has length 296 [2019-09-08 09:40:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:47,251 INFO L475 AbstractCegarLoop]: Abstraction has 6478 states and 9904 transitions. [2019-09-08 09:40:47,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 9904 transitions. [2019-09-08 09:40:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-08 09:40:47,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:47,266 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] [2019-09-08 09:40:47,267 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2113224453, now seen corresponding path program 1 times [2019-09-08 09:40:47,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:47,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:47,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:47,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:47,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:47,402 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 09:40:47,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:47,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:47,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:47,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:47,404 INFO L87 Difference]: Start difference. First operand 6478 states and 9904 transitions. Second operand 3 states. [2019-09-08 09:40:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:47,878 INFO L93 Difference]: Finished difference Result 17684 states and 26730 transitions. [2019-09-08 09:40:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:47,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-09-08 09:40:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:47,908 INFO L225 Difference]: With dead ends: 17684 [2019-09-08 09:40:47,908 INFO L226 Difference]: Without dead ends: 12106 [2019-09-08 09:40:47,923 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 09:40:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12106 states. [2019-09-08 09:40:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12106 to 6603. [2019-09-08 09:40:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6603 states. [2019-09-08 09:40:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6603 states to 6603 states and 10050 transitions. [2019-09-08 09:40:48,815 INFO L78 Accepts]: Start accepts. Automaton has 6603 states and 10050 transitions. Word has length 297 [2019-09-08 09:40:48,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:48,816 INFO L475 AbstractCegarLoop]: Abstraction has 6603 states and 10050 transitions. [2019-09-08 09:40:48,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6603 states and 10050 transitions. [2019-09-08 09:40:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-08 09:40:48,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:48,831 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] [2019-09-08 09:40:48,831 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:48,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash -703602847, now seen corresponding path program 1 times [2019-09-08 09:40:48,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:48,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:48,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:48,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:48,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:49,299 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 09:40:49,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:49,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:49,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:49,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:49,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:49,301 INFO L87 Difference]: Start difference. First operand 6603 states and 10050 transitions. Second operand 4 states. [2019-09-08 09:40:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:49,898 INFO L93 Difference]: Finished difference Result 14578 states and 22154 transitions. [2019-09-08 09:40:49,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:49,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-09-08 09:40:49,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:49,924 INFO L225 Difference]: With dead ends: 14578 [2019-09-08 09:40:49,924 INFO L226 Difference]: Without dead ends: 7540 [2019-09-08 09:40:49,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-09-08 09:40:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 7449. [2019-09-08 09:40:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7449 states. [2019-09-08 09:40:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7449 states to 7449 states and 11297 transitions. [2019-09-08 09:40:50,431 INFO L78 Accepts]: Start accepts. Automaton has 7449 states and 11297 transitions. Word has length 298 [2019-09-08 09:40:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:50,432 INFO L475 AbstractCegarLoop]: Abstraction has 7449 states and 11297 transitions. [2019-09-08 09:40:50,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7449 states and 11297 transitions. [2019-09-08 09:40:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:40:50,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:50,508 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] [2019-09-08 09:40:50,509 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:50,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:50,509 INFO L82 PathProgramCache]: Analyzing trace with hash -421707953, now seen corresponding path program 1 times [2019-09-08 09:40:50,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:50,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:50,636 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 09:40:50,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:50,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:50,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:50,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:50,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:50,638 INFO L87 Difference]: Start difference. First operand 7449 states and 11297 transitions. Second operand 3 states. [2019-09-08 09:40:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:51,376 INFO L93 Difference]: Finished difference Result 21381 states and 32253 transitions. [2019-09-08 09:40:51,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:51,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-08 09:40:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:51,411 INFO L225 Difference]: With dead ends: 21381 [2019-09-08 09:40:51,411 INFO L226 Difference]: Without dead ends: 14431 [2019-09-08 09:40:51,428 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 09:40:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14431 states. [2019-09-08 09:40:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14431 to 7519. [2019-09-08 09:40:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7519 states. [2019-09-08 09:40:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7519 states to 7519 states and 11388 transitions. [2019-09-08 09:40:51,973 INFO L78 Accepts]: Start accepts. Automaton has 7519 states and 11388 transitions. Word has length 300 [2019-09-08 09:40:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:51,973 INFO L475 AbstractCegarLoop]: Abstraction has 7519 states and 11388 transitions. [2019-09-08 09:40:51,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 7519 states and 11388 transitions. [2019-09-08 09:40:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:40:51,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:51,987 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] [2019-09-08 09:40:51,988 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:51,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1681679701, now seen corresponding path program 1 times [2019-09-08 09:40:51,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:51,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:51,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:52,386 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 09:40:52,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:52,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:52,388 INFO L87 Difference]: Start difference. First operand 7519 states and 11388 transitions. Second operand 4 states. [2019-09-08 09:40:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:53,055 INFO L93 Difference]: Finished difference Result 21042 states and 31741 transitions. [2019-09-08 09:40:53,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:53,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-09-08 09:40:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:53,081 INFO L225 Difference]: With dead ends: 21042 [2019-09-08 09:40:53,081 INFO L226 Difference]: Without dead ends: 14700 [2019-09-08 09:40:53,098 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 09:40:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14700 states. [2019-09-08 09:40:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14700 to 8381. [2019-09-08 09:40:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8381 states. [2019-09-08 09:40:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 12812 transitions. [2019-09-08 09:40:53,730 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 12812 transitions. Word has length 300 [2019-09-08 09:40:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:53,730 INFO L475 AbstractCegarLoop]: Abstraction has 8381 states and 12812 transitions. [2019-09-08 09:40:53,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 12812 transitions. [2019-09-08 09:40:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:40:53,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:53,747 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] [2019-09-08 09:40:53,748 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:53,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1171308623, now seen corresponding path program 1 times [2019-09-08 09:40:53,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:53,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:53,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:53,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:53,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:54,044 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 09:40:54,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:54,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:54,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:54,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:54,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:54,047 INFO L87 Difference]: Start difference. First operand 8381 states and 12812 transitions. Second operand 3 states. [2019-09-08 09:40:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:54,872 INFO L93 Difference]: Finished difference Result 24402 states and 37192 transitions. [2019-09-08 09:40:54,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:54,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-08 09:40:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:54,908 INFO L225 Difference]: With dead ends: 24402 [2019-09-08 09:40:54,908 INFO L226 Difference]: Without dead ends: 16460 [2019-09-08 09:40:54,926 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 09:40:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16460 states. [2019-09-08 09:40:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16460 to 16376. [2019-09-08 09:40:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16376 states. [2019-09-08 09:40:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16376 states to 16376 states and 24897 transitions. [2019-09-08 09:40:56,310 INFO L78 Accepts]: Start accepts. Automaton has 16376 states and 24897 transitions. Word has length 300 [2019-09-08 09:40:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:56,310 INFO L475 AbstractCegarLoop]: Abstraction has 16376 states and 24897 transitions. [2019-09-08 09:40:56,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 16376 states and 24897 transitions. [2019-09-08 09:40:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 09:40:56,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:56,337 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] [2019-09-08 09:40:56,338 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:56,338 INFO L82 PathProgramCache]: Analyzing trace with hash 943792940, now seen corresponding path program 1 times [2019-09-08 09:40:56,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:56,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:56,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:56,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 09:40:56,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:56,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:56,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:56,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:56,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:56,677 INFO L87 Difference]: Start difference. First operand 16376 states and 24897 transitions. Second operand 4 states. [2019-09-08 09:40:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:58,104 INFO L93 Difference]: Finished difference Result 43547 states and 65677 transitions. [2019-09-08 09:40:58,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:58,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-09-08 09:40:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:58,141 INFO L225 Difference]: With dead ends: 43547 [2019-09-08 09:40:58,142 INFO L226 Difference]: Without dead ends: 31264 [2019-09-08 09:40:58,163 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 09:40:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31264 states. [2019-09-08 09:40:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31264 to 18969. [2019-09-08 09:40:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18969 states. [2019-09-08 09:40:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18969 states to 18969 states and 29177 transitions. [2019-09-08 09:40:59,218 INFO L78 Accepts]: Start accepts. Automaton has 18969 states and 29177 transitions. Word has length 300 [2019-09-08 09:40:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:59,218 INFO L475 AbstractCegarLoop]: Abstraction has 18969 states and 29177 transitions. [2019-09-08 09:40:59,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 18969 states and 29177 transitions. [2019-09-08 09:40:59,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 09:40:59,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:59,237 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] [2019-09-08 09:40:59,238 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:59,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:59,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1112064626, now seen corresponding path program 1 times [2019-09-08 09:40:59,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:59,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:59,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:59,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:59,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:59,363 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 09:40:59,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:59,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:59,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:59,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:59,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:59,367 INFO L87 Difference]: Start difference. First operand 18969 states and 29177 transitions. Second operand 3 states. [2019-09-08 09:41:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:00,844 INFO L93 Difference]: Finished difference Result 50957 states and 77621 transitions. [2019-09-08 09:41:00,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:00,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-09-08 09:41:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:00,886 INFO L225 Difference]: With dead ends: 50957 [2019-09-08 09:41:00,886 INFO L226 Difference]: Without dead ends: 35051 [2019-09-08 09:41:00,915 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 09:41:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35051 states. [2019-09-08 09:41:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35051 to 19553. [2019-09-08 09:41:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19553 states. [2019-09-08 09:41:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19553 states to 19553 states and 29853 transitions. [2019-09-08 09:41:02,181 INFO L78 Accepts]: Start accepts. Automaton has 19553 states and 29853 transitions. Word has length 301 [2019-09-08 09:41:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:02,181 INFO L475 AbstractCegarLoop]: Abstraction has 19553 states and 29853 transitions. [2019-09-08 09:41:02,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 19553 states and 29853 transitions. [2019-09-08 09:41:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:41:02,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:02,198 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] [2019-09-08 09:41:02,199 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:02,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash -415895678, now seen corresponding path program 1 times [2019-09-08 09:41:02,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:02,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:02,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:02,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:02,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:02,485 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 09:41:02,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:02,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:41:02,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:41:02,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:41:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:02,487 INFO L87 Difference]: Start difference. First operand 19553 states and 29853 transitions. Second operand 4 states. [2019-09-08 09:41:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:04,231 INFO L93 Difference]: Finished difference Result 31331 states and 47385 transitions. [2019-09-08 09:41:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:04,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-08 09:41:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:04,255 INFO L225 Difference]: With dead ends: 31331 [2019-09-08 09:41:04,255 INFO L226 Difference]: Without dead ends: 26162 [2019-09-08 09:41:04,263 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 09:41:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26162 states. [2019-09-08 09:41:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26162 to 21113. [2019-09-08 09:41:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21113 states. [2019-09-08 09:41:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21113 states to 21113 states and 32361 transitions. [2019-09-08 09:41:05,228 INFO L78 Accepts]: Start accepts. Automaton has 21113 states and 32361 transitions. Word has length 302 [2019-09-08 09:41:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:05,228 INFO L475 AbstractCegarLoop]: Abstraction has 21113 states and 32361 transitions. [2019-09-08 09:41:05,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 21113 states and 32361 transitions. [2019-09-08 09:41:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 09:41:05,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:05,252 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] [2019-09-08 09:41:05,253 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:05,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1297132717, now seen corresponding path program 1 times [2019-09-08 09:41:05,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:05,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:05,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:05,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:05,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:05,683 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 09:41:05,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:05,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:41:05,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:41:05,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:41:05,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:41:05,685 INFO L87 Difference]: Start difference. First operand 21113 states and 32361 transitions. Second operand 4 states. [2019-09-08 09:41:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:07,985 INFO L93 Difference]: Finished difference Result 61019 states and 93203 transitions. [2019-09-08 09:41:07,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:41:07,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-08 09:41:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:08,025 INFO L225 Difference]: With dead ends: 61019 [2019-09-08 09:41:08,026 INFO L226 Difference]: Without dead ends: 40785 [2019-09-08 09:41:08,053 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 09:41:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40785 states. [2019-09-08 09:41:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40785 to 40688. [2019-09-08 09:41:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40688 states. [2019-09-08 09:41:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40688 states to 40688 states and 61695 transitions. [2019-09-08 09:41:10,200 INFO L78 Accepts]: Start accepts. Automaton has 40688 states and 61695 transitions. Word has length 302 [2019-09-08 09:41:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:10,200 INFO L475 AbstractCegarLoop]: Abstraction has 40688 states and 61695 transitions. [2019-09-08 09:41:10,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:41:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 40688 states and 61695 transitions. [2019-09-08 09:41:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:41:10,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:10,246 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] [2019-09-08 09:41:10,246 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1565661785, now seen corresponding path program 1 times [2019-09-08 09:41:10,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:10,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:10,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:10,412 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 09:41:10,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:10,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:10,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:10,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:10,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:10,414 INFO L87 Difference]: Start difference. First operand 40688 states and 61695 transitions. Second operand 3 states. [2019-09-08 09:41:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:15,026 INFO L93 Difference]: Finished difference Result 115872 states and 175035 transitions. [2019-09-08 09:41:15,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:15,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 09:41:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:15,110 INFO L225 Difference]: With dead ends: 115872 [2019-09-08 09:41:15,110 INFO L226 Difference]: Without dead ends: 76881 [2019-09-08 09:41:15,161 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 09:41:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76881 states. [2019-09-08 09:41:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76881 to 41450. [2019-09-08 09:41:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41450 states. [2019-09-08 09:41:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41450 states to 41450 states and 62741 transitions. [2019-09-08 09:41:17,538 INFO L78 Accepts]: Start accepts. Automaton has 41450 states and 62741 transitions. Word has length 304 [2019-09-08 09:41:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:17,539 INFO L475 AbstractCegarLoop]: Abstraction has 41450 states and 62741 transitions. [2019-09-08 09:41:17,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 41450 states and 62741 transitions. [2019-09-08 09:41:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 09:41:17,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:17,570 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] [2019-09-08 09:41:17,571 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:17,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1057740574, now seen corresponding path program 1 times [2019-09-08 09:41:17,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:17,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:17,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:17,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:17,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:17,791 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 09:41:17,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:17,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:17,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:17,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:17,793 INFO L87 Difference]: Start difference. First operand 41450 states and 62741 transitions. Second operand 3 states. [2019-09-08 09:41:23,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:23,140 INFO L93 Difference]: Finished difference Result 112684 states and 170035 transitions. [2019-09-08 09:41:23,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:23,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-08 09:41:23,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:23,217 INFO L225 Difference]: With dead ends: 112684 [2019-09-08 09:41:23,217 INFO L226 Difference]: Without dead ends: 80945 [2019-09-08 09:41:23,243 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 09:41:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80945 states. [2019-09-08 09:41:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80945 to 80848. [2019-09-08 09:41:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80848 states. [2019-09-08 09:41:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80848 states to 80848 states and 121623 transitions. [2019-09-08 09:41:27,738 INFO L78 Accepts]: Start accepts. Automaton has 80848 states and 121623 transitions. Word has length 304 [2019-09-08 09:41:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:27,738 INFO L475 AbstractCegarLoop]: Abstraction has 80848 states and 121623 transitions. [2019-09-08 09:41:27,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 80848 states and 121623 transitions. [2019-09-08 09:41:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 09:41:27,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:27,799 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] [2019-09-08 09:41:27,799 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:27,800 INFO L82 PathProgramCache]: Analyzing trace with hash -973318490, now seen corresponding path program 1 times [2019-09-08 09:41:27,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:27,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:27,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:27,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:27,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:27,922 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 09:41:27,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:27,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:27,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:27,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:27,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:27,924 INFO L87 Difference]: Start difference. First operand 80848 states and 121623 transitions. Second operand 3 states. [2019-09-08 09:41:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:37,498 INFO L93 Difference]: Finished difference Result 233310 states and 349801 transitions. [2019-09-08 09:41:37,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:37,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-08 09:41:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:37,682 INFO L225 Difference]: With dead ends: 233310 [2019-09-08 09:41:37,683 INFO L226 Difference]: Without dead ends: 158065 [2019-09-08 09:41:37,754 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 09:41:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158065 states. [2019-09-08 09:41:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158065 to 81964. [2019-09-08 09:41:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81964 states. [2019-09-08 09:41:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81964 states to 81964 states and 122925 transitions. [2019-09-08 09:41:45,514 INFO L78 Accepts]: Start accepts. Automaton has 81964 states and 122925 transitions. Word has length 305 [2019-09-08 09:41:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:45,515 INFO L475 AbstractCegarLoop]: Abstraction has 81964 states and 122925 transitions. [2019-09-08 09:41:45,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:41:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 81964 states and 122925 transitions. [2019-09-08 09:41:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:41:45,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:45,573 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] [2019-09-08 09:41:45,573 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1011642237, now seen corresponding path program 1 times [2019-09-08 09:41:45,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:45,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:45,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:45,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:45,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:45,851 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 09:41:45,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:45,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:41:45,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:41:45,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:41:45,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:41:45,853 INFO L87 Difference]: Start difference. First operand 81964 states and 122925 transitions. Second operand 3 states. [2019-09-08 09:41:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:55,216 INFO L93 Difference]: Finished difference Result 220093 states and 329828 transitions. [2019-09-08 09:41:55,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:41:55,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-08 09:41:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:55,393 INFO L225 Difference]: With dead ends: 220093 [2019-09-08 09:41:55,393 INFO L226 Difference]: Without dead ends: 155805 [2019-09-08 09:41:55,453 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 09:41:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155805 states. [2019-09-08 09:42:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155805 to 155708. [2019-09-08 09:42:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155708 states. [2019-09-08 09:42:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155708 states to 155708 states and 232567 transitions. [2019-09-08 09:42:07,199 INFO L78 Accepts]: Start accepts. Automaton has 155708 states and 232567 transitions. Word has length 306 [2019-09-08 09:42:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:07,199 INFO L475 AbstractCegarLoop]: Abstraction has 155708 states and 232567 transitions. [2019-09-08 09:42:07,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:42:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 155708 states and 232567 transitions. [2019-09-08 09:42:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 09:42:07,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:07,821 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] [2019-09-08 09:42:07,822 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:07,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:07,822 INFO L82 PathProgramCache]: Analyzing trace with hash -700324454, now seen corresponding path program 1 times [2019-09-08 09:42:07,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:07,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:07,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:07,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:07,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:08,084 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 09:42:08,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:08,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:42:08,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:42:08,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:42:08,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:42:08,086 INFO L87 Difference]: Start difference. First operand 155708 states and 232567 transitions. Second operand 4 states. [2019-09-08 09:42:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:27,138 INFO L93 Difference]: Finished difference Result 359954 states and 533614 transitions. [2019-09-08 09:42:27,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:42:27,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-08 09:42:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:27,466 INFO L225 Difference]: With dead ends: 359954 [2019-09-08 09:42:27,466 INFO L226 Difference]: Without dead ends: 269927 [2019-09-08 09:42:27,559 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 09:42:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269927 states. [2019-09-08 09:42:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269927 to 192822. [2019-09-08 09:42:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192822 states. [2019-09-08 09:42:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192822 states to 192822 states and 289762 transitions. [2019-09-08 09:42:45,613 INFO L78 Accepts]: Start accepts. Automaton has 192822 states and 289762 transitions. Word has length 306 [2019-09-08 09:42:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:45,613 INFO L475 AbstractCegarLoop]: Abstraction has 192822 states and 289762 transitions. [2019-09-08 09:42:45,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:42:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 192822 states and 289762 transitions. [2019-09-08 09:42:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 09:42:45,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:45,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:42:45,768 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash 379502000, now seen corresponding path program 1 times [2019-09-08 09:42:45,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:45,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:45,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:45,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:45,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:45,894 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 09:42:45,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:45,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:42:45,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:42:45,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:42:45,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:42:45,896 INFO L87 Difference]: Start difference. First operand 192822 states and 289762 transitions. Second operand 3 states. [2019-09-08 09:43:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:06,433 INFO L93 Difference]: Finished difference Result 372344 states and 550650 transitions. [2019-09-08 09:43:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:06,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-08 09:43:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:06,743 INFO L225 Difference]: With dead ends: 372344 [2019-09-08 09:43:06,743 INFO L226 Difference]: Without dead ends: 283159 [2019-09-08 09:43:06,824 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 09:43:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283159 states. [2019-09-08 09:43:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283159 to 196150. [2019-09-08 09:43:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196150 states. [2019-09-08 09:43:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196150 states to 196150 states and 294338 transitions. [2019-09-08 09:43:26,347 INFO L78 Accepts]: Start accepts. Automaton has 196150 states and 294338 transitions. Word has length 308 [2019-09-08 09:43:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:26,347 INFO L475 AbstractCegarLoop]: Abstraction has 196150 states and 294338 transitions. [2019-09-08 09:43:26,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:43:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 196150 states and 294338 transitions. [2019-09-08 09:43:26,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-08 09:43:26,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:26,520 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] [2019-09-08 09:43:26,521 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:26,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:26,521 INFO L82 PathProgramCache]: Analyzing trace with hash 86756029, now seen corresponding path program 1 times [2019-09-08 09:43:26,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:26,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:26,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:26,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:26,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:26,660 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 09:43:26,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:26,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:43:26,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:43:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:43:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:43:26,662 INFO L87 Difference]: Start difference. First operand 196150 states and 294338 transitions. Second operand 3 states. [2019-09-08 09:43:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:46,413 INFO L93 Difference]: Finished difference Result 376424 states and 555533 transitions. [2019-09-08 09:43:46,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:43:46,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-08 09:43:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:46,736 INFO L225 Difference]: With dead ends: 376424 [2019-09-08 09:43:46,737 INFO L226 Difference]: Without dead ends: 287087 [2019-09-08 09:43:46,827 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 09:43:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287087 states. [2019-09-08 09:44:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287087 to 200078. [2019-09-08 09:44:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200078 states. [2019-09-08 09:44:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200078 states to 200078 states and 298938 transitions. [2019-09-08 09:44:06,634 INFO L78 Accepts]: Start accepts. Automaton has 200078 states and 298938 transitions. Word has length 309 [2019-09-08 09:44:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:06,634 INFO L475 AbstractCegarLoop]: Abstraction has 200078 states and 298938 transitions. [2019-09-08 09:44:06,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:44:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 200078 states and 298938 transitions. [2019-09-08 09:44:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 09:44:06,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:06,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:44:06,816 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash 816353955, now seen corresponding path program 1 times [2019-09-08 09:44:06,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:06,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:06,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:07,102 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 09:44:07,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:07,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:44:07,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:44:07,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:44:07,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:44:07,106 INFO L87 Difference]: Start difference. First operand 200078 states and 298938 transitions. Second operand 4 states. [2019-09-08 09:44:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:30,059 INFO L93 Difference]: Finished difference Result 440720 states and 659477 transitions. [2019-09-08 09:44:30,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:44:30,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-09-08 09:44:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:30,542 INFO L225 Difference]: With dead ends: 440720 [2019-09-08 09:44:30,542 INFO L226 Difference]: Without dead ends: 224689 [2019-09-08 09:44:30,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:44:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224689 states. [2019-09-08 09:44:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224689 to 224592. [2019-09-08 09:44:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224592 states. [2019-09-08 09:44:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224592 states to 224592 states and 332612 transitions. [2019-09-08 09:44:47,365 INFO L78 Accepts]: Start accepts. Automaton has 224592 states and 332612 transitions. Word has length 310 [2019-09-08 09:44:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:47,365 INFO L475 AbstractCegarLoop]: Abstraction has 224592 states and 332612 transitions. [2019-09-08 09:44:47,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:44:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 224592 states and 332612 transitions. [2019-09-08 09:44:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-08 09:44:47,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:47,568 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] [2019-09-08 09:44:47,569 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash -404301481, now seen corresponding path program 1 times [2019-09-08 09:44:47,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:47,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:47,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:47,863 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 09:44:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:47,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:44:47,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:44:47,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:44:47,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:44:47,865 INFO L87 Difference]: Start difference. First operand 224592 states and 332612 transitions. Second operand 4 states. [2019-09-08 09:45:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:20,591 INFO L93 Difference]: Finished difference Result 508300 states and 745881 transitions. [2019-09-08 09:45:20,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:45:20,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-08 09:45:20,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:21,136 INFO L225 Difference]: With dead ends: 508300 [2019-09-08 09:45:21,136 INFO L226 Difference]: Without dead ends: 403483 [2019-09-08 09:45:21,262 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 09:45:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403483 states. [2019-09-08 09:45:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403483 to 297354. [2019-09-08 09:45:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297354 states. [2019-09-08 09:45:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297354 states to 297354 states and 441697 transitions. [2019-09-08 09:45:49,422 INFO L78 Accepts]: Start accepts. Automaton has 297354 states and 441697 transitions. Word has length 312 [2019-09-08 09:45:49,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:49,422 INFO L475 AbstractCegarLoop]: Abstraction has 297354 states and 441697 transitions. [2019-09-08 09:45:49,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:45:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 297354 states and 441697 transitions. [2019-09-08 09:45:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:45:49,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:49,724 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:45:49,724 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:49,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash -294170261, now seen corresponding path program 1 times [2019-09-08 09:45:49,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:49,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:49,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:49,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:49,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:49,857 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 09:45:49,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:49,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:45:49,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:45:49,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:45:49,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:45:49,859 INFO L87 Difference]: Start difference. First operand 297354 states and 441697 transitions. Second operand 3 states. [2019-09-08 09:46:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:23,334 INFO L93 Difference]: Finished difference Result 485260 states and 710425 transitions. [2019-09-08 09:46:23,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:23,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 09:46:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:24,175 INFO L225 Difference]: With dead ends: 485260 [2019-09-08 09:46:24,175 INFO L226 Difference]: Without dead ends: 391499 [2019-09-08 09:46:24,285 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 09:46:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391499 states. [2019-09-08 09:46:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391499 to 300042. [2019-09-08 09:46:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300042 states. [2019-09-08 09:46:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300042 states to 300042 states and 445345 transitions. [2019-09-08 09:46:53,676 INFO L78 Accepts]: Start accepts. Automaton has 300042 states and 445345 transitions. Word has length 314 [2019-09-08 09:46:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:53,677 INFO L475 AbstractCegarLoop]: Abstraction has 300042 states and 445345 transitions. [2019-09-08 09:46:53,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 300042 states and 445345 transitions. [2019-09-08 09:46:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:46:54,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:54,024 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] [2019-09-08 09:46:54,024 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:54,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2094927638, now seen corresponding path program 1 times [2019-09-08 09:46:54,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:54,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:54,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:54,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:54,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:54,188 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 09:46:54,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:54,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:54,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:54,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:54,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:54,190 INFO L87 Difference]: Start difference. First operand 300042 states and 445345 transitions. Second operand 3 states. [2019-09-08 09:47:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:26,994 INFO L93 Difference]: Finished difference Result 437020 states and 642937 transitions. [2019-09-08 09:47:26,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:26,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 09:47:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:27,486 INFO L225 Difference]: With dead ends: 437020 [2019-09-08 09:47:27,486 INFO L226 Difference]: Without dead ends: 368555 [2019-09-08 09:47:27,588 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 09:47:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368555 states. [2019-09-08 09:48:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368555 to 368458. [2019-09-08 09:48:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368458 states. [2019-09-08 09:48:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368458 states to 368458 states and 542385 transitions. [2019-09-08 09:48:04,218 INFO L78 Accepts]: Start accepts. Automaton has 368458 states and 542385 transitions. Word has length 314 [2019-09-08 09:48:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:04,219 INFO L475 AbstractCegarLoop]: Abstraction has 368458 states and 542385 transitions. [2019-09-08 09:48:04,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:48:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 368458 states and 542385 transitions. [2019-09-08 09:48:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:48:05,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:05,247 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] [2019-09-08 09:48:05,247 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:05,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:05,247 INFO L82 PathProgramCache]: Analyzing trace with hash -648955616, now seen corresponding path program 1 times [2019-09-08 09:48:05,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:05,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:05,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:05,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:05,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:05,683 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 09:48:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:48:05,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:48:05,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:48:05,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:48:05,684 INFO L87 Difference]: Start difference. First operand 368458 states and 542385 transitions. Second operand 8 states. [2019-09-08 09:48:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:46,811 INFO L93 Difference]: Finished difference Result 483188 states and 714178 transitions. [2019-09-08 09:48:46,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:48:46,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 314 [2019-09-08 09:48:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:47,327 INFO L225 Difference]: With dead ends: 483188 [2019-09-08 09:48:47,327 INFO L226 Difference]: Without dead ends: 447148 [2019-09-08 09:48:47,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:48:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447148 states. [2019-09-08 09:49:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447148 to 447146. [2019-09-08 09:49:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447146 states. [2019-09-08 09:49:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447146 states to 447146 states and 655633 transitions. [2019-09-08 09:49:35,773 INFO L78 Accepts]: Start accepts. Automaton has 447146 states and 655633 transitions. Word has length 314 [2019-09-08 09:49:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:35,773 INFO L475 AbstractCegarLoop]: Abstraction has 447146 states and 655633 transitions. [2019-09-08 09:49:35,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:49:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 447146 states and 655633 transitions. [2019-09-08 09:49:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:49:36,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:36,165 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] [2019-09-08 09:49:36,165 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:36,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:36,165 INFO L82 PathProgramCache]: Analyzing trace with hash -604099693, now seen corresponding path program 1 times [2019-09-08 09:49:36,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:36,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:36,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:36,411 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 09:49:36,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:36,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:49:36,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:49:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:49:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:49:36,413 INFO L87 Difference]: Start difference. First operand 447146 states and 655633 transitions. Second operand 3 states. [2019-09-08 09:50:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:35,347 INFO L93 Difference]: Finished difference Result 653936 states and 964588 transitions. [2019-09-08 09:50:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:50:35,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 09:50:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:35,997 INFO L225 Difference]: With dead ends: 653936 [2019-09-08 09:50:35,997 INFO L226 Difference]: Without dead ends: 575701 [2019-09-08 09:50:36,118 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 09:50:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575701 states. [2019-09-08 09:51:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575701 to 574487. [2019-09-08 09:51:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574487 states. [2019-09-08 09:51:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574487 states to 574487 states and 837746 transitions. [2019-09-08 09:51:40,387 INFO L78 Accepts]: Start accepts. Automaton has 574487 states and 837746 transitions. Word has length 314 [2019-09-08 09:51:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:40,388 INFO L475 AbstractCegarLoop]: Abstraction has 574487 states and 837746 transitions. [2019-09-08 09:51:40,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 574487 states and 837746 transitions. [2019-09-08 09:51:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 09:51:40,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:40,886 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] [2019-09-08 09:51:40,886 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:40,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash 909000710, now seen corresponding path program 1 times [2019-09-08 09:51:40,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:40,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:40,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:41,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 09:51:41,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:41,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 09:51:41,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 09:51:41,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 09:51:41,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 09:51:41,817 INFO L87 Difference]: Start difference. First operand 574487 states and 837746 transitions. Second operand 15 states.