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/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:12:46,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:12:46,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:12:46,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:12:46,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:12:46,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:12:46,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:12:46,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:12:46,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:12:46,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:12:46,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:12:46,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:12:46,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:12:46,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:12:46,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:12:46,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:12:46,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:12:46,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:12:46,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:12:46,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:12:46,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:12:46,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:12:46,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:12:46,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:12:46,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:12:46,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:12:46,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:12:46,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:12:46,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:12:46,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:12:46,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:12:46,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:12:46,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:12:46,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:12:46,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:12:46,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:12:46,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:12:46,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:12:46,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:12:46,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:12:46,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:12:46,854 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 08:12:46,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:12:46,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:12:46,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:12:46,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:12:46,869 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:12:46,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:12:46,870 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:12:46,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:12:46,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:12:46,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:12:46,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:12:46,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:12:46,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:12:46,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:12:46,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:12:46,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:12:46,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:12:46,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:12:46,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:12:46,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:12:46,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:12:46,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:12:46,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:12:46,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:12:46,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:12:46,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:12:46,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:12:46,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:12:46,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:12:46,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:12:46,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:12:46,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:12:46,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:12:46,919 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:12:46,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-09-08 08:12:46,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c400b6cce/e32c321237f6404ca51cb7ef93c81a79/FLAG85c850a80 [2019-09-08 08:12:47,504 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:12:47,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-09-08 08:12:47,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c400b6cce/e32c321237f6404ca51cb7ef93c81a79/FLAG85c850a80 [2019-09-08 08:12:47,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c400b6cce/e32c321237f6404ca51cb7ef93c81a79 [2019-09-08 08:12:47,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:12:47,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:12:47,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:12:47,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:12:47,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:12:47,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:12:47" (1/1) ... [2019-09-08 08:12:47,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71a34a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:47, skipping insertion in model container [2019-09-08 08:12:47,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:12:47" (1/1) ... [2019-09-08 08:12:47,813 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:12:47,863 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:12:48,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:12:48,246 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:12:48,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:12:48,385 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:12:48,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48 WrapperNode [2019-09-08 08:12:48,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:12:48,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:12:48,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:12:48,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:12:48,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48" (1/1) ... [2019-09-08 08:12:48,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48" (1/1) ... [2019-09-08 08:12:48,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48" (1/1) ... [2019-09-08 08:12:48,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48" (1/1) ... [2019-09-08 08:12:48,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48" (1/1) ... [2019-09-08 08:12:48,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48" (1/1) ... [2019-09-08 08:12:48,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48" (1/1) ... [2019-09-08 08:12:48,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:12:48,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:12:48,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:12:48,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:12:48,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48" (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 08:12:48,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:12:48,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:12:48,503 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:12:48,503 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:12:48,504 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:12:48,504 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:12:48,504 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:12:48,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:12:48,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:12:48,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:12:48,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:12:48,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:12:48,506 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:12:48,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:12:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:12:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:12:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:12:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:12:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:12:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:12:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:12:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:12:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:12:48,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:12:49,259 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:12:49,260 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:12:49,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:12:49 BoogieIcfgContainer [2019-09-08 08:12:49,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:12:49,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:12:49,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:12:49,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:12:49,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:12:47" (1/3) ... [2019-09-08 08:12:49,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c522546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:12:49, skipping insertion in model container [2019-09-08 08:12:49,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:12:48" (2/3) ... [2019-09-08 08:12:49,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c522546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:12:49, skipping insertion in model container [2019-09-08 08:12:49,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:12:49" (3/3) ... [2019-09-08 08:12:49,269 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-09-08 08:12:49,278 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:12:49,286 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:12:49,303 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:12:49,332 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:12:49,333 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:12:49,333 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:12:49,333 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:12:49,333 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:12:49,334 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:12:49,334 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:12:49,334 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:12:49,334 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:12:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-09-08 08:12:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 08:12:49,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:49,368 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] [2019-09-08 08:12:49,371 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:49,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1106693626, now seen corresponding path program 1 times [2019-09-08 08:12:49,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:49,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:49,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:49,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:49,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:49,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 08:12:49,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:49,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:12:49,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:12:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:12:49,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:12:49,818 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 5 states. [2019-09-08 08:12:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:49,983 INFO L93 Difference]: Finished difference Result 274 states and 435 transitions. [2019-09-08 08:12:49,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:12:49,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 08:12:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:49,998 INFO L225 Difference]: With dead ends: 274 [2019-09-08 08:12:49,998 INFO L226 Difference]: Without dead ends: 163 [2019-09-08 08:12:50,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:12:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-08 08:12:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-09-08 08:12:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-08 08:12:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. [2019-09-08 08:12:50,091 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 235 transitions. Word has length 59 [2019-09-08 08:12:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:50,092 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 235 transitions. [2019-09-08 08:12:50,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:12:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 235 transitions. [2019-09-08 08:12:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 08:12:50,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:50,097 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] [2019-09-08 08:12:50,097 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1798610632, now seen corresponding path program 1 times [2019-09-08 08:12:50,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:50,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:50,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:50,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:50,307 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 08:12:50,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:50,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:12:50,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:12:50,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:12:50,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:12:50,312 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand 5 states. [2019-09-08 08:12:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:50,957 INFO L93 Difference]: Finished difference Result 358 states and 537 transitions. [2019-09-08 08:12:50,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:12:50,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-08 08:12:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:50,968 INFO L225 Difference]: With dead ends: 358 [2019-09-08 08:12:50,968 INFO L226 Difference]: Without dead ends: 261 [2019-09-08 08:12:50,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:12:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-08 08:12:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253. [2019-09-08 08:12:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-08 08:12:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 368 transitions. [2019-09-08 08:12:51,008 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 368 transitions. Word has length 88 [2019-09-08 08:12:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:51,008 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 368 transitions. [2019-09-08 08:12:51,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:12:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 368 transitions. [2019-09-08 08:12:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:12:51,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:51,013 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] [2019-09-08 08:12:51,013 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash -704489299, now seen corresponding path program 1 times [2019-09-08 08:12:51,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:51,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:51,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:51,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:51,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:51,127 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 08:12:51,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:51,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:12:51,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:12:51,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:12:51,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:12:51,132 INFO L87 Difference]: Start difference. First operand 253 states and 368 transitions. Second operand 5 states. [2019-09-08 08:12:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:51,637 INFO L93 Difference]: Finished difference Result 621 states and 922 transitions. [2019-09-08 08:12:51,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:12:51,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 08:12:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:51,642 INFO L225 Difference]: With dead ends: 621 [2019-09-08 08:12:51,642 INFO L226 Difference]: Without dead ends: 434 [2019-09-08 08:12:51,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:12:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-09-08 08:12:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 426. [2019-09-08 08:12:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-08 08:12:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 627 transitions. [2019-09-08 08:12:51,680 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 627 transitions. Word has length 90 [2019-09-08 08:12:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:51,681 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 627 transitions. [2019-09-08 08:12:51,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:12:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 627 transitions. [2019-09-08 08:12:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 08:12:51,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:51,685 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] [2019-09-08 08:12:51,685 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:51,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:51,685 INFO L82 PathProgramCache]: Analyzing trace with hash 812819256, now seen corresponding path program 1 times [2019-09-08 08:12:51,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:51,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:51,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:51,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:51,824 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 08:12:51,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:51,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:12:51,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:12:51,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:12:51,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:12:51,826 INFO L87 Difference]: Start difference. First operand 426 states and 627 transitions. Second operand 5 states. [2019-09-08 08:12:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:52,314 INFO L93 Difference]: Finished difference Result 1134 states and 1685 transitions. [2019-09-08 08:12:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:12:52,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 08:12:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:52,321 INFO L225 Difference]: With dead ends: 1134 [2019-09-08 08:12:52,322 INFO L226 Difference]: Without dead ends: 774 [2019-09-08 08:12:52,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:12:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-09-08 08:12:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 760. [2019-09-08 08:12:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-09-08 08:12:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1121 transitions. [2019-09-08 08:12:52,372 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1121 transitions. Word has length 92 [2019-09-08 08:12:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:52,373 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 1121 transitions. [2019-09-08 08:12:52,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:12:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1121 transitions. [2019-09-08 08:12:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 08:12:52,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:52,376 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] [2019-09-08 08:12:52,376 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:52,376 INFO L82 PathProgramCache]: Analyzing trace with hash 735799213, now seen corresponding path program 1 times [2019-09-08 08:12:52,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:52,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:52,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:52,512 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 08:12:52,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:52,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:12:52,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:12:52,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:12:52,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:12:52,515 INFO L87 Difference]: Start difference. First operand 760 states and 1121 transitions. Second operand 9 states. [2019-09-08 08:12:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:55,299 INFO L93 Difference]: Finished difference Result 4285 states and 6504 transitions. [2019-09-08 08:12:55,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 08:12:55,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-08 08:12:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:55,328 INFO L225 Difference]: With dead ends: 4285 [2019-09-08 08:12:55,329 INFO L226 Difference]: Without dead ends: 3591 [2019-09-08 08:12:55,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 08:12:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2019-09-08 08:12:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3511. [2019-09-08 08:12:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3511 states. [2019-09-08 08:12:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5321 transitions. [2019-09-08 08:12:55,541 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5321 transitions. Word has length 94 [2019-09-08 08:12:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:55,542 INFO L475 AbstractCegarLoop]: Abstraction has 3511 states and 5321 transitions. [2019-09-08 08:12:55,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:12:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5321 transitions. [2019-09-08 08:12:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:12:55,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:55,545 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] [2019-09-08 08:12:55,546 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:55,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1111632109, now seen corresponding path program 1 times [2019-09-08 08:12:55,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:55,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:55,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:55,675 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 08:12:55,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:55,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:12:55,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:12:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:12:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:12:55,677 INFO L87 Difference]: Start difference. First operand 3511 states and 5321 transitions. Second operand 6 states. [2019-09-08 08:12:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:12:56,841 INFO L93 Difference]: Finished difference Result 9384 states and 14285 transitions. [2019-09-08 08:12:56,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:12:56,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 08:12:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:12:56,876 INFO L225 Difference]: With dead ends: 9384 [2019-09-08 08:12:56,877 INFO L226 Difference]: Without dead ends: 5939 [2019-09-08 08:12:56,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:12:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2019-09-08 08:12:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 4829. [2019-09-08 08:12:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4829 states. [2019-09-08 08:12:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4829 states to 4829 states and 7325 transitions. [2019-09-08 08:12:57,106 INFO L78 Accepts]: Start accepts. Automaton has 4829 states and 7325 transitions. Word has length 95 [2019-09-08 08:12:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:12:57,106 INFO L475 AbstractCegarLoop]: Abstraction has 4829 states and 7325 transitions. [2019-09-08 08:12:57,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:12:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4829 states and 7325 transitions. [2019-09-08 08:12:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:12:57,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:12:57,111 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] [2019-09-08 08:12:57,111 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:12:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:12:57,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1166847690, now seen corresponding path program 1 times [2019-09-08 08:12:57,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:12:57,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:12:57,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:57,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:12:57,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:12:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:12:57,295 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 08:12:57,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:12:57,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:12:57,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:12:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:12:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:12:57,298 INFO L87 Difference]: Start difference. First operand 4829 states and 7325 transitions. Second operand 9 states. [2019-09-08 08:13:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:00,659 INFO L93 Difference]: Finished difference Result 10101 states and 15367 transitions. [2019-09-08 08:13:00,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 08:13:00,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 08:13:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:00,718 INFO L225 Difference]: With dead ends: 10101 [2019-09-08 08:13:00,718 INFO L226 Difference]: Without dead ends: 7935 [2019-09-08 08:13:00,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 08:13:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2019-09-08 08:13:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 7001. [2019-09-08 08:13:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7001 states. [2019-09-08 08:13:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 10647 transitions. [2019-09-08 08:13:01,230 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 10647 transitions. Word has length 96 [2019-09-08 08:13:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:01,231 INFO L475 AbstractCegarLoop]: Abstraction has 7001 states and 10647 transitions. [2019-09-08 08:13:01,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:13:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 10647 transitions. [2019-09-08 08:13:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:01,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:01,240 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] [2019-09-08 08:13:01,240 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:01,241 INFO L82 PathProgramCache]: Analyzing trace with hash -434937692, now seen corresponding path program 1 times [2019-09-08 08:13:01,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:01,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:01,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:01,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:01,427 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 08:13:01,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:01,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:13:01,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:13:01,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:13:01,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:13:01,429 INFO L87 Difference]: Start difference. First operand 7001 states and 10647 transitions. Second operand 9 states. [2019-09-08 08:13:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:04,259 INFO L93 Difference]: Finished difference Result 14202 states and 21668 transitions. [2019-09-08 08:13:04,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 08:13:04,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 08:13:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:04,320 INFO L225 Difference]: With dead ends: 14202 [2019-09-08 08:13:04,321 INFO L226 Difference]: Without dead ends: 10767 [2019-09-08 08:13:04,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 08:13:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10767 states. [2019-09-08 08:13:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10767 to 9381. [2019-09-08 08:13:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9381 states. [2019-09-08 08:13:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9381 states to 9381 states and 14281 transitions. [2019-09-08 08:13:04,745 INFO L78 Accepts]: Start accepts. Automaton has 9381 states and 14281 transitions. Word has length 96 [2019-09-08 08:13:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:04,745 INFO L475 AbstractCegarLoop]: Abstraction has 9381 states and 14281 transitions. [2019-09-08 08:13:04,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:13:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 9381 states and 14281 transitions. [2019-09-08 08:13:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:04,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:04,751 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] [2019-09-08 08:13:04,751 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:04,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:04,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1695854116, now seen corresponding path program 1 times [2019-09-08 08:13:04,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:04,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:04,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:04,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:04,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:04,868 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 08:13:04,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:04,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:04,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:04,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:04,870 INFO L87 Difference]: Start difference. First operand 9381 states and 14281 transitions. Second operand 6 states. [2019-09-08 08:13:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:06,316 INFO L93 Difference]: Finished difference Result 27776 states and 42481 transitions. [2019-09-08 08:13:06,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:13:06,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 08:13:06,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:06,392 INFO L225 Difference]: With dead ends: 27776 [2019-09-08 08:13:06,393 INFO L226 Difference]: Without dead ends: 18461 [2019-09-08 08:13:06,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:13:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18461 states. [2019-09-08 08:13:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18461 to 18268. [2019-09-08 08:13:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18268 states. [2019-09-08 08:13:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18268 states to 18268 states and 27763 transitions. [2019-09-08 08:13:07,164 INFO L78 Accepts]: Start accepts. Automaton has 18268 states and 27763 transitions. Word has length 96 [2019-09-08 08:13:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:07,165 INFO L475 AbstractCegarLoop]: Abstraction has 18268 states and 27763 transitions. [2019-09-08 08:13:07,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 18268 states and 27763 transitions. [2019-09-08 08:13:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:07,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:07,170 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] [2019-09-08 08:13:07,170 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:07,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1703080734, now seen corresponding path program 1 times [2019-09-08 08:13:07,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:07,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:07,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:07,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:07,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:07,249 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 08:13:07,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:07,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:07,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:07,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:07,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:07,251 INFO L87 Difference]: Start difference. First operand 18268 states and 27763 transitions. Second operand 5 states. [2019-09-08 08:13:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:08,882 INFO L93 Difference]: Finished difference Result 39154 states and 60263 transitions. [2019-09-08 08:13:08,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:13:08,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 08:13:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:09,009 INFO L225 Difference]: With dead ends: 39154 [2019-09-08 08:13:09,009 INFO L226 Difference]: Without dead ends: 33648 [2019-09-08 08:13:09,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:13:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33648 states. [2019-09-08 08:13:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33648 to 33208. [2019-09-08 08:13:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33208 states. [2019-09-08 08:13:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33208 states to 33208 states and 50901 transitions. [2019-09-08 08:13:10,298 INFO L78 Accepts]: Start accepts. Automaton has 33208 states and 50901 transitions. Word has length 96 [2019-09-08 08:13:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:10,298 INFO L475 AbstractCegarLoop]: Abstraction has 33208 states and 50901 transitions. [2019-09-08 08:13:10,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 33208 states and 50901 transitions. [2019-09-08 08:13:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:13:10,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:10,304 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] [2019-09-08 08:13:10,305 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1518071062, now seen corresponding path program 1 times [2019-09-08 08:13:10,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:10,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:10,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:10,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:10,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:10,388 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 08:13:10,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:10,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:10,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:10,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:10,390 INFO L87 Difference]: Start difference. First operand 33208 states and 50901 transitions. Second operand 6 states. [2019-09-08 08:13:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:12,496 INFO L93 Difference]: Finished difference Result 100112 states and 153993 transitions. [2019-09-08 08:13:12,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:13:12,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 08:13:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:12,782 INFO L225 Difference]: With dead ends: 100112 [2019-09-08 08:13:12,783 INFO L226 Difference]: Without dead ends: 66970 [2019-09-08 08:13:12,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:13:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66970 states. [2019-09-08 08:13:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66970 to 66284. [2019-09-08 08:13:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66284 states. [2019-09-08 08:13:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66284 states to 66284 states and 101643 transitions. [2019-09-08 08:13:16,151 INFO L78 Accepts]: Start accepts. Automaton has 66284 states and 101643 transitions. Word has length 97 [2019-09-08 08:13:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:16,151 INFO L475 AbstractCegarLoop]: Abstraction has 66284 states and 101643 transitions. [2019-09-08 08:13:16,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 66284 states and 101643 transitions. [2019-09-08 08:13:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:13:16,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:16,158 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] [2019-09-08 08:13:16,158 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1436506364, now seen corresponding path program 1 times [2019-09-08 08:13:16,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:16,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:16,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:16,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:16,246 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 08:13:16,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:16,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 08:13:16,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 08:13:16,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 08:13:16,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:13:16,247 INFO L87 Difference]: Start difference. First operand 66284 states and 101643 transitions. Second operand 7 states. [2019-09-08 08:13:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:20,227 INFO L93 Difference]: Finished difference Result 127930 states and 196939 transitions. [2019-09-08 08:13:20,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:13:20,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-08 08:13:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:20,545 INFO L225 Difference]: With dead ends: 127930 [2019-09-08 08:13:20,545 INFO L226 Difference]: Without dead ends: 87622 [2019-09-08 08:13:20,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:13:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87622 states. [2019-09-08 08:13:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87622 to 79752. [2019-09-08 08:13:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79752 states. [2019-09-08 08:13:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79752 states to 79752 states and 122335 transitions. [2019-09-08 08:13:23,230 INFO L78 Accepts]: Start accepts. Automaton has 79752 states and 122335 transitions. Word has length 97 [2019-09-08 08:13:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:23,230 INFO L475 AbstractCegarLoop]: Abstraction has 79752 states and 122335 transitions. [2019-09-08 08:13:23,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 08:13:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 79752 states and 122335 transitions. [2019-09-08 08:13:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:13:23,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:23,239 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] [2019-09-08 08:13:23,239 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash 882269751, now seen corresponding path program 1 times [2019-09-08 08:13:23,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:23,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:23,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:23,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 08:13:23,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:23,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:13:23,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:13:23,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:13:23,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:13:23,301 INFO L87 Difference]: Start difference. First operand 79752 states and 122335 transitions. Second operand 4 states. [2019-09-08 08:13:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:28,431 INFO L93 Difference]: Finished difference Result 242005 states and 379944 transitions. [2019-09-08 08:13:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:13:28,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 08:13:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:28,983 INFO L225 Difference]: With dead ends: 242005 [2019-09-08 08:13:28,983 INFO L226 Difference]: Without dead ends: 162319 [2019-09-08 08:13:29,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:13:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162319 states. [2019-09-08 08:13:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162319 to 162299. [2019-09-08 08:13:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162299 states. [2019-09-08 08:13:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162299 states to 162299 states and 244603 transitions. [2019-09-08 08:13:36,252 INFO L78 Accepts]: Start accepts. Automaton has 162299 states and 244603 transitions. Word has length 97 [2019-09-08 08:13:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:36,252 INFO L475 AbstractCegarLoop]: Abstraction has 162299 states and 244603 transitions. [2019-09-08 08:13:36,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:13:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 162299 states and 244603 transitions. [2019-09-08 08:13:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:13:36,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:36,265 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] [2019-09-08 08:13:36,265 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash -487701475, now seen corresponding path program 1 times [2019-09-08 08:13:36,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:36,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:36,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:36,322 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 08:13:36,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:36,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:13:36,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:13:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:13:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:13:36,324 INFO L87 Difference]: Start difference. First operand 162299 states and 244603 transitions. Second operand 4 states. [2019-09-08 08:13:43,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:43,890 INFO L93 Difference]: Finished difference Result 447095 states and 688668 transitions. [2019-09-08 08:13:43,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:13:43,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 08:13:43,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:45,427 INFO L225 Difference]: With dead ends: 447095 [2019-09-08 08:13:45,427 INFO L226 Difference]: Without dead ends: 285009 [2019-09-08 08:13:45,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:13:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285009 states. [2019-09-08 08:13:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285009 to 284939. [2019-09-08 08:13:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284939 states. [2019-09-08 08:13:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284939 states to 284939 states and 424316 transitions. [2019-09-08 08:13:57,715 INFO L78 Accepts]: Start accepts. Automaton has 284939 states and 424316 transitions. Word has length 97 [2019-09-08 08:13:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:57,715 INFO L475 AbstractCegarLoop]: Abstraction has 284939 states and 424316 transitions. [2019-09-08 08:13:57,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:13:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 284939 states and 424316 transitions. [2019-09-08 08:13:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 08:13:57,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:57,737 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] [2019-09-08 08:13:57,737 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 777456621, now seen corresponding path program 1 times [2019-09-08 08:13:57,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:57,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:57,907 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 08:13:57,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:57,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:57,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:57,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:57,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:57,908 INFO L87 Difference]: Start difference. First operand 284939 states and 424316 transitions. Second operand 6 states. [2019-09-08 08:14:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:09,797 INFO L93 Difference]: Finished difference Result 495336 states and 740905 transitions. [2019-09-08 08:14:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:14:09,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-08 08:14:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:10,967 INFO L225 Difference]: With dead ends: 495336 [2019-09-08 08:14:10,967 INFO L226 Difference]: Without dead ends: 293706 [2019-09-08 08:14:11,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:14:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293706 states. [2019-09-08 08:14:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293706 to 285652. [2019-09-08 08:14:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285652 states. [2019-09-08 08:14:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285652 states to 285652 states and 424057 transitions. [2019-09-08 08:14:22,415 INFO L78 Accepts]: Start accepts. Automaton has 285652 states and 424057 transitions. Word has length 98 [2019-09-08 08:14:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:22,415 INFO L475 AbstractCegarLoop]: Abstraction has 285652 states and 424057 transitions. [2019-09-08 08:14:22,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:14:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 285652 states and 424057 transitions. [2019-09-08 08:14:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 08:14:22,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:22,427 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] [2019-09-08 08:14:22,428 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:22,428 INFO L82 PathProgramCache]: Analyzing trace with hash -651811160, now seen corresponding path program 1 times [2019-09-08 08:14:22,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:22,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:22,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:22,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:22,588 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 08:14:22,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:22,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:14:22,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:14:22,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:14:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:14:22,590 INFO L87 Difference]: Start difference. First operand 285652 states and 424057 transitions. Second operand 11 states. [2019-09-08 08:14:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:35,807 INFO L93 Difference]: Finished difference Result 487956 states and 729523 transitions. [2019-09-08 08:14:35,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:14:35,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 08:14:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:37,005 INFO L225 Difference]: With dead ends: 487956 [2019-09-08 08:14:37,005 INFO L226 Difference]: Without dead ends: 364580 [2019-09-08 08:14:37,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:14:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364580 states. [2019-09-08 08:14:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364580 to 292182. [2019-09-08 08:14:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292182 states. [2019-09-08 08:14:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292182 states to 292182 states and 433843 transitions. [2019-09-08 08:14:52,759 INFO L78 Accepts]: Start accepts. Automaton has 292182 states and 433843 transitions. Word has length 98 [2019-09-08 08:14:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:52,760 INFO L475 AbstractCegarLoop]: Abstraction has 292182 states and 433843 transitions. [2019-09-08 08:14:52,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:14:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 292182 states and 433843 transitions. [2019-09-08 08:14:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 08:14:52,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:52,771 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] [2019-09-08 08:14:52,771 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:52,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1294133123, now seen corresponding path program 1 times [2019-09-08 08:14:52,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:52,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:52,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:52,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:52,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:52,906 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 08:14:52,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:52,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:14:52,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:14:52,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:14:52,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:14:52,908 INFO L87 Difference]: Start difference. First operand 292182 states and 433843 transitions. Second operand 11 states. [2019-09-08 08:15:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:15:08,528 INFO L93 Difference]: Finished difference Result 493051 states and 736495 transitions. [2019-09-08 08:15:08,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:15:08,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 08:15:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:15:09,539 INFO L225 Difference]: With dead ends: 493051 [2019-09-08 08:15:09,539 INFO L226 Difference]: Without dead ends: 366388 [2019-09-08 08:15:10,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:15:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366388 states. [2019-09-08 08:15:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366388 to 294874. [2019-09-08 08:15:25,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294874 states. [2019-09-08 08:15:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294874 states to 294874 states and 437915 transitions. [2019-09-08 08:15:27,539 INFO L78 Accepts]: Start accepts. Automaton has 294874 states and 437915 transitions. Word has length 98 [2019-09-08 08:15:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:15:27,540 INFO L475 AbstractCegarLoop]: Abstraction has 294874 states and 437915 transitions. [2019-09-08 08:15:27,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:15:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 294874 states and 437915 transitions. [2019-09-08 08:15:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:15:27,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:15:27,546 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] [2019-09-08 08:15:27,546 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:15:27,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:15:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash 488202899, now seen corresponding path program 1 times [2019-09-08 08:15:27,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:15:27,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:15:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:27,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:15:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:15:27,680 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 08:15:27,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:15:27,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 08:15:27,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 08:15:27,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 08:15:27,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:15:27,682 INFO L87 Difference]: Start difference. First operand 294874 states and 437915 transitions. Second operand 10 states. [2019-09-08 08:15:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:15:50,525 INFO L93 Difference]: Finished difference Result 635831 states and 949594 transitions. [2019-09-08 08:15:50,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 08:15:50,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-09-08 08:15:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:15:51,604 INFO L225 Difference]: With dead ends: 635831 [2019-09-08 08:15:51,605 INFO L226 Difference]: Without dead ends: 435349 [2019-09-08 08:15:51,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=952, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 08:15:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435349 states. [2019-09-08 08:16:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435349 to 418001. [2019-09-08 08:16:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418001 states. [2019-09-08 08:16:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418001 states to 418001 states and 623699 transitions. [2019-09-08 08:16:18,470 INFO L78 Accepts]: Start accepts. Automaton has 418001 states and 623699 transitions. Word has length 99 [2019-09-08 08:16:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:16:18,471 INFO L475 AbstractCegarLoop]: Abstraction has 418001 states and 623699 transitions. [2019-09-08 08:16:18,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 08:16:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 418001 states and 623699 transitions. [2019-09-08 08:16:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:16:18,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:16:18,477 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] [2019-09-08 08:16:18,477 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:16:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:16:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1200740843, now seen corresponding path program 1 times [2019-09-08 08:16:18,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:16:18,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:16:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:18,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:16:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:16:18,566 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 08:16:18,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:16:18,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:16:18,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:16:18,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:16:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:16:18,568 INFO L87 Difference]: Start difference. First operand 418001 states and 623699 transitions. Second operand 5 states. [2019-09-08 08:16:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:16:44,730 INFO L93 Difference]: Finished difference Result 1023757 states and 1546785 transitions. [2019-09-08 08:16:44,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:16:44,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 08:16:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:16:46,838 INFO L225 Difference]: With dead ends: 1023757 [2019-09-08 08:16:46,838 INFO L226 Difference]: Without dead ends: 726879 [2019-09-08 08:16:47,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:16:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726879 states. [2019-09-08 08:17:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726879 to 716612. [2019-09-08 08:17:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716612 states. [2019-09-08 08:17:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716612 states to 716612 states and 1079506 transitions. [2019-09-08 08:17:37,121 INFO L78 Accepts]: Start accepts. Automaton has 716612 states and 1079506 transitions. Word has length 99 [2019-09-08 08:17:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:17:37,122 INFO L475 AbstractCegarLoop]: Abstraction has 716612 states and 1079506 transitions. [2019-09-08 08:17:37,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:17:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 716612 states and 1079506 transitions. [2019-09-08 08:17:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:17:37,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:17:37,129 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] [2019-09-08 08:17:37,130 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:17:37,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:17:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1797172734, now seen corresponding path program 1 times [2019-09-08 08:17:37,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:17:37,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:17:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:17:37,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:17:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:17:37,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:17:37,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:17:37,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:17:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:17:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:17:37,285 INFO L87 Difference]: Start difference. First operand 716612 states and 1079506 transitions. Second operand 5 states. [2019-09-08 08:18:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:44,693 INFO L93 Difference]: Finished difference Result 2121584 states and 3245766 transitions. [2019-09-08 08:18:44,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:18:44,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 08:18:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:48,647 INFO L225 Difference]: With dead ends: 2121584 [2019-09-08 08:18:48,647 INFO L226 Difference]: Without dead ends: 1404986 [2019-09-08 08:18:51,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:18:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404986 states.