java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:50:47,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:50:47,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:50:47,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:50:47,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:50:47,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:50:47,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:50:47,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:50:47,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:50:47,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:50:47,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:50:47,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:50:47,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:50:47,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:50:47,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:50:47,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:50:47,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:50:47,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:50:47,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:50:47,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:50:47,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:50:47,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:50:47,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:50:47,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:50:47,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:50:47,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:50:47,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:50:47,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:50:47,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:50:47,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:50:47,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:50:47,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:50:47,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:50:47,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:50:47,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:50:47,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:50:47,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:50:47,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:50:47,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:50:47,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:50:47,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:50:47,315 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 11:50:47,344 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:50:47,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:50:47,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:50:47,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:50:47,348 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:50:47,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:50:47,349 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:50:47,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:50:47,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:50:47,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:50:47,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:50:47,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:50:47,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:50:47,351 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:50:47,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:50:47,352 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:50:47,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:50:47,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:50:47,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:50:47,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:50:47,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:50:47,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:50:47,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:50:47,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:50:47,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:50:47,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:50:47,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:50:47,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:50:47,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:50:47,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:50:47,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:50:47,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:50:47,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:50:47,433 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:50:47,434 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 11:50:47,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa9fd62a/7950699463314711abe22ebdd00386e8/FLAG2c421c844 [2019-09-08 11:50:48,174 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:50:48,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 11:50:48,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa9fd62a/7950699463314711abe22ebdd00386e8/FLAG2c421c844 [2019-09-08 11:50:48,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa9fd62a/7950699463314711abe22ebdd00386e8 [2019-09-08 11:50:48,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:50:48,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:50:48,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:50:48,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:50:48,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:50:48,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:50:48" (1/1) ... [2019-09-08 11:50:48,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:48, skipping insertion in model container [2019-09-08 11:50:48,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:50:48" (1/1) ... [2019-09-08 11:50:48,403 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:50:48,502 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:50:49,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:50:49,401 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:50:49,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:50:49,661 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:50:49,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49 WrapperNode [2019-09-08 11:50:49,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:50:49,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:50:49,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:50:49,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:50:49,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49" (1/1) ... [2019-09-08 11:50:49,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49" (1/1) ... [2019-09-08 11:50:49,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49" (1/1) ... [2019-09-08 11:50:49,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49" (1/1) ... [2019-09-08 11:50:49,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49" (1/1) ... [2019-09-08 11:50:49,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49" (1/1) ... [2019-09-08 11:50:49,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49" (1/1) ... [2019-09-08 11:50:49,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:50:49,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:50:49,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:50:49,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:50:49,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49" (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 11:50:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:50:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:50:49,915 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:50:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:50:49,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:50:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:50:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:50:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:50:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:50:49,917 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:50:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:50:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:50:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:50:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:50:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:50:49,920 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:50:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:50:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:50:49,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:50:51,982 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:50:51,982 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:50:51,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:50:51 BoogieIcfgContainer [2019-09-08 11:50:51,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:50:51,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:50:51,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:50:51,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:50:51,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:50:48" (1/3) ... [2019-09-08 11:50:51,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@946e649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:50:51, skipping insertion in model container [2019-09-08 11:50:51,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:49" (2/3) ... [2019-09-08 11:50:51,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@946e649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:50:51, skipping insertion in model container [2019-09-08 11:50:51,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:50:51" (3/3) ... [2019-09-08 11:50:51,996 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 11:50:52,006 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:50:52,027 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-08 11:50:52,043 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-08 11:50:52,079 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:50:52,080 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:50:52,080 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:50:52,080 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:50:52,081 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:50:52,081 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:50:52,081 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:50:52,081 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:50:52,081 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:50:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states. [2019-09-08 11:50:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:50:52,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:52,128 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] [2019-09-08 11:50:52,131 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:52,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash -45640292, now seen corresponding path program 1 times [2019-09-08 11:50:52,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:52,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:52,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:52,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:52,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:52,794 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 11:50:52,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:52,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:50:52,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:50:52,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:50:52,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:50:52,819 INFO L87 Difference]: Start difference. First operand 575 states. Second operand 6 states. [2019-09-08 11:50:53,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:53,689 INFO L93 Difference]: Finished difference Result 906 states and 1509 transitions. [2019-09-08 11:50:53,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:50:53,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-09-08 11:50:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:53,713 INFO L225 Difference]: With dead ends: 906 [2019-09-08 11:50:53,713 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 11:50:53,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:50:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 11:50:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 575. [2019-09-08 11:50:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-08 11:50:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 729 transitions. [2019-09-08 11:50:53,826 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 729 transitions. Word has length 64 [2019-09-08 11:50:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:53,827 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 729 transitions. [2019-09-08 11:50:53,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:50:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 729 transitions. [2019-09-08 11:50:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:50:53,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:53,832 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] [2019-09-08 11:50:53,832 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:53,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1649351166, now seen corresponding path program 1 times [2019-09-08 11:50:53,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:53,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:53,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:53,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:53,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:53,992 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 11:50:53,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:53,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:50:53,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:50:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:50:53,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:50:53,996 INFO L87 Difference]: Start difference. First operand 575 states and 729 transitions. Second operand 5 states. [2019-09-08 11:50:54,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:54,336 INFO L93 Difference]: Finished difference Result 724 states and 930 transitions. [2019-09-08 11:50:54,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:50:54,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-08 11:50:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:54,342 INFO L225 Difference]: With dead ends: 724 [2019-09-08 11:50:54,343 INFO L226 Difference]: Without dead ends: 423 [2019-09-08 11:50:54,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:50:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-09-08 11:50:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2019-09-08 11:50:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 11:50:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 535 transitions. [2019-09-08 11:50:54,377 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 535 transitions. Word has length 64 [2019-09-08 11:50:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:54,377 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 535 transitions. [2019-09-08 11:50:54,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:50:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 535 transitions. [2019-09-08 11:50:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:50:54,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:54,380 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] [2019-09-08 11:50:54,380 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:54,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1630759173, now seen corresponding path program 1 times [2019-09-08 11:50:54,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:54,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:54,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:54,482 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 11:50:54,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:54,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:50:54,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:50:54,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:50:54,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:50:54,483 INFO L87 Difference]: Start difference. First operand 423 states and 535 transitions. Second operand 5 states. [2019-09-08 11:50:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:54,761 INFO L93 Difference]: Finished difference Result 627 states and 810 transitions. [2019-09-08 11:50:54,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:50:54,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-08 11:50:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:54,765 INFO L225 Difference]: With dead ends: 627 [2019-09-08 11:50:54,766 INFO L226 Difference]: Without dead ends: 374 [2019-09-08 11:50:54,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:50:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-08 11:50:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2019-09-08 11:50:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-08 11:50:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 476 transitions. [2019-09-08 11:50:54,791 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 476 transitions. Word has length 64 [2019-09-08 11:50:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:54,793 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 476 transitions. [2019-09-08 11:50:54,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:50:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 476 transitions. [2019-09-08 11:50:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:50:54,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:54,798 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] [2019-09-08 11:50:54,798 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1724870339, now seen corresponding path program 1 times [2019-09-08 11:50:54,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:54,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:54,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:54,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:54,934 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 11:50:54,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:50:54,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:50:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:50:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:50:54,937 INFO L87 Difference]: Start difference. First operand 374 states and 476 transitions. Second operand 5 states. [2019-09-08 11:50:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:55,146 INFO L93 Difference]: Finished difference Result 555 states and 717 transitions. [2019-09-08 11:50:55,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:50:55,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 11:50:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:55,149 INFO L225 Difference]: With dead ends: 555 [2019-09-08 11:50:55,149 INFO L226 Difference]: Without dead ends: 333 [2019-09-08 11:50:55,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:50:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-08 11:50:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-09-08 11:50:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:50:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 423 transitions. [2019-09-08 11:50:55,168 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 423 transitions. Word has length 66 [2019-09-08 11:50:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:55,168 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 423 transitions. [2019-09-08 11:50:55,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:50:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 423 transitions. [2019-09-08 11:50:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:50:55,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:55,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] [2019-09-08 11:50:55,171 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash 726626472, now seen corresponding path program 1 times [2019-09-08 11:50:55,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:55,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:55,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:55,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:55,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:55,445 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 11:50:55,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:55,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:50:55,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:50:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:50:55,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:50:55,449 INFO L87 Difference]: Start difference. First operand 333 states and 423 transitions. Second operand 8 states. [2019-09-08 11:50:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:56,066 INFO L93 Difference]: Finished difference Result 733 states and 960 transitions. [2019-09-08 11:50:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:50:56,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-09-08 11:50:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:56,070 INFO L225 Difference]: With dead ends: 733 [2019-09-08 11:50:56,070 INFO L226 Difference]: Without dead ends: 533 [2019-09-08 11:50:56,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:50:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-08 11:50:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 333. [2019-09-08 11:50:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:50:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 422 transitions. [2019-09-08 11:50:56,094 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 422 transitions. Word has length 68 [2019-09-08 11:50:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:56,094 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 422 transitions. [2019-09-08 11:50:56,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:50:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 422 transitions. [2019-09-08 11:50:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:50:56,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:56,096 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] [2019-09-08 11:50:56,096 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1014461784, now seen corresponding path program 1 times [2019-09-08 11:50:56,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:56,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:56,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:56,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:56,247 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 11:50:56,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:56,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:56,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:56,248 INFO L87 Difference]: Start difference. First operand 333 states and 422 transitions. Second operand 9 states. [2019-09-08 11:50:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:57,335 INFO L93 Difference]: Finished difference Result 900 states and 1218 transitions. [2019-09-08 11:50:57,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:57,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:50:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:57,341 INFO L225 Difference]: With dead ends: 900 [2019-09-08 11:50:57,342 INFO L226 Difference]: Without dead ends: 752 [2019-09-08 11:50:57,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-08 11:50:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 333. [2019-09-08 11:50:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:50:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 421 transitions. [2019-09-08 11:50:57,399 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 421 transitions. Word has length 68 [2019-09-08 11:50:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:57,400 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 421 transitions. [2019-09-08 11:50:57,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 421 transitions. [2019-09-08 11:50:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:50:57,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:57,402 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] [2019-09-08 11:50:57,402 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:57,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:57,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1312203704, now seen corresponding path program 1 times [2019-09-08 11:50:57,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:57,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:57,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:57,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:57,602 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 11:50:57,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:57,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:57,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:57,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:57,604 INFO L87 Difference]: Start difference. First operand 333 states and 421 transitions. Second operand 9 states. [2019-09-08 11:50:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:58,585 INFO L93 Difference]: Finished difference Result 872 states and 1182 transitions. [2019-09-08 11:50:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:58,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-09-08 11:50:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:58,592 INFO L225 Difference]: With dead ends: 872 [2019-09-08 11:50:58,593 INFO L226 Difference]: Without dead ends: 753 [2019-09-08 11:50:58,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-08 11:50:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 333. [2019-09-08 11:50:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:50:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 420 transitions. [2019-09-08 11:50:58,623 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 420 transitions. Word has length 68 [2019-09-08 11:50:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:58,625 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 420 transitions. [2019-09-08 11:50:58,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 420 transitions. [2019-09-08 11:50:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:50:58,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:58,632 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] [2019-09-08 11:50:58,632 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1888529039, now seen corresponding path program 1 times [2019-09-08 11:50:58,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:58,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:58,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:58,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:58,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:58,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:58,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:58,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:58,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:58,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:58,802 INFO L87 Difference]: Start difference. First operand 333 states and 420 transitions. Second operand 9 states. [2019-09-08 11:50:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:59,954 INFO L93 Difference]: Finished difference Result 848 states and 1146 transitions. [2019-09-08 11:50:59,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:59,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:50:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:59,958 INFO L225 Difference]: With dead ends: 848 [2019-09-08 11:50:59,959 INFO L226 Difference]: Without dead ends: 740 [2019-09-08 11:50:59,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-08 11:50:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 333. [2019-09-08 11:50:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:50:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 419 transitions. [2019-09-08 11:50:59,988 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 419 transitions. Word has length 69 [2019-09-08 11:50:59,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:59,988 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 419 transitions. [2019-09-08 11:50:59,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 419 transitions. [2019-09-08 11:50:59,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:50:59,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:59,990 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] [2019-09-08 11:50:59,990 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:59,990 INFO L82 PathProgramCache]: Analyzing trace with hash 251258957, now seen corresponding path program 1 times [2019-09-08 11:50:59,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:59,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:59,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:00,133 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 11:51:00,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:00,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:00,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:00,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:00,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:00,135 INFO L87 Difference]: Start difference. First operand 333 states and 419 transitions. Second operand 9 states. [2019-09-08 11:51:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:01,175 INFO L93 Difference]: Finished difference Result 772 states and 1028 transitions. [2019-09-08 11:51:01,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:51:01,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:51:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:01,180 INFO L225 Difference]: With dead ends: 772 [2019-09-08 11:51:01,180 INFO L226 Difference]: Without dead ends: 753 [2019-09-08 11:51:01,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-08 11:51:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 333. [2019-09-08 11:51:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:51:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 418 transitions. [2019-09-08 11:51:01,211 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 418 transitions. Word has length 70 [2019-09-08 11:51:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:01,211 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 418 transitions. [2019-09-08 11:51:01,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 418 transitions. [2019-09-08 11:51:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:51:01,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:01,213 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] [2019-09-08 11:51:01,213 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:01,213 INFO L82 PathProgramCache]: Analyzing trace with hash 120874925, now seen corresponding path program 1 times [2019-09-08 11:51:01,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:01,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:01,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:01,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:01,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:01,346 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 11:51:01,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:01,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:01,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:01,348 INFO L87 Difference]: Start difference. First operand 333 states and 418 transitions. Second operand 9 states. [2019-09-08 11:51:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:02,337 INFO L93 Difference]: Finished difference Result 746 states and 990 transitions. [2019-09-08 11:51:02,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:51:02,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:51:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:02,342 INFO L225 Difference]: With dead ends: 746 [2019-09-08 11:51:02,342 INFO L226 Difference]: Without dead ends: 740 [2019-09-08 11:51:02,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-08 11:51:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 333. [2019-09-08 11:51:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:51:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 417 transitions. [2019-09-08 11:51:02,377 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 417 transitions. Word has length 70 [2019-09-08 11:51:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:02,377 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 417 transitions. [2019-09-08 11:51:02,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 417 transitions. [2019-09-08 11:51:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:51:02,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:02,379 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] [2019-09-08 11:51:02,379 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:02,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:02,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1647730477, now seen corresponding path program 1 times [2019-09-08 11:51:02,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:02,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:02,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:02,514 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 11:51:02,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:02,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:02,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:02,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:02,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:02,516 INFO L87 Difference]: Start difference. First operand 333 states and 417 transitions. Second operand 9 states. [2019-09-08 11:51:03,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:03,644 INFO L93 Difference]: Finished difference Result 909 states and 1218 transitions. [2019-09-08 11:51:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:51:03,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:51:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:03,650 INFO L225 Difference]: With dead ends: 909 [2019-09-08 11:51:03,650 INFO L226 Difference]: Without dead ends: 752 [2019-09-08 11:51:03,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-08 11:51:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 333. [2019-09-08 11:51:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:51:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 416 transitions. [2019-09-08 11:51:03,701 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 416 transitions. Word has length 70 [2019-09-08 11:51:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:03,702 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 416 transitions. [2019-09-08 11:51:03,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 416 transitions. [2019-09-08 11:51:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:51:03,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:03,704 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] [2019-09-08 11:51:03,705 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1135659117, now seen corresponding path program 1 times [2019-09-08 11:51:03,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:03,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:03,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:03,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:03,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:03,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 11:51:03,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:03,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:03,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:03,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:03,908 INFO L87 Difference]: Start difference. First operand 333 states and 416 transitions. Second operand 9 states. [2019-09-08 11:51:04,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:04,970 INFO L93 Difference]: Finished difference Result 746 states and 988 transitions. [2019-09-08 11:51:04,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:51:04,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:51:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:04,974 INFO L225 Difference]: With dead ends: 746 [2019-09-08 11:51:04,974 INFO L226 Difference]: Without dead ends: 740 [2019-09-08 11:51:04,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-08 11:51:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 333. [2019-09-08 11:51:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:51:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 415 transitions. [2019-09-08 11:51:05,010 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 415 transitions. Word has length 70 [2019-09-08 11:51:05,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:05,010 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 415 transitions. [2019-09-08 11:51:05,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 415 transitions. [2019-09-08 11:51:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:51:05,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:05,012 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] [2019-09-08 11:51:05,012 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:05,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1963584653, now seen corresponding path program 1 times [2019-09-08 11:51:05,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:05,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:05,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:05,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:05,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:05,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:05,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:05,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:05,155 INFO L87 Difference]: Start difference. First operand 333 states and 415 transitions. Second operand 9 states. [2019-09-08 11:51:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:06,118 INFO L93 Difference]: Finished difference Result 851 states and 1143 transitions. [2019-09-08 11:51:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:51:06,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:51:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:06,122 INFO L225 Difference]: With dead ends: 851 [2019-09-08 11:51:06,122 INFO L226 Difference]: Without dead ends: 740 [2019-09-08 11:51:06,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-09-08 11:51:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 333. [2019-09-08 11:51:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:51:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 414 transitions. [2019-09-08 11:51:06,159 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 414 transitions. Word has length 70 [2019-09-08 11:51:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:06,159 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 414 transitions. [2019-09-08 11:51:06,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2019-09-08 11:51:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:51:06,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:06,161 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] [2019-09-08 11:51:06,161 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash -483426451, now seen corresponding path program 1 times [2019-09-08 11:51:06,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:06,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:06,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:06,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:06,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:06,313 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 11:51:06,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:06,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:06,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:06,315 INFO L87 Difference]: Start difference. First operand 333 states and 414 transitions. Second operand 9 states. [2019-09-08 11:51:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:07,392 INFO L93 Difference]: Finished difference Result 877 states and 1179 transitions. [2019-09-08 11:51:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:51:07,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 11:51:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:07,395 INFO L225 Difference]: With dead ends: 877 [2019-09-08 11:51:07,395 INFO L226 Difference]: Without dead ends: 753 [2019-09-08 11:51:07,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-08 11:51:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 333. [2019-09-08 11:51:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-08 11:51:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 413 transitions. [2019-09-08 11:51:07,434 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 413 transitions. Word has length 70 [2019-09-08 11:51:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:07,435 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 413 transitions. [2019-09-08 11:51:07,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 413 transitions. [2019-09-08 11:51:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:51:07,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:07,436 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] [2019-09-08 11:51:07,436 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:07,437 INFO L82 PathProgramCache]: Analyzing trace with hash 13599436, now seen corresponding path program 1 times [2019-09-08 11:51:07,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:07,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:07,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:07,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:08,256 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 11:51:08,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:08,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:51:08,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:51:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:51:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:51:08,257 INFO L87 Difference]: Start difference. First operand 333 states and 413 transitions. Second operand 16 states. [2019-09-08 11:51:08,972 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:51:09,370 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-08 11:51:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:10,792 INFO L93 Difference]: Finished difference Result 901 states and 1164 transitions. [2019-09-08 11:51:10,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:51:10,793 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-08 11:51:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:10,796 INFO L225 Difference]: With dead ends: 901 [2019-09-08 11:51:10,796 INFO L226 Difference]: Without dead ends: 795 [2019-09-08 11:51:10,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:51:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-09-08 11:51:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 348. [2019-09-08 11:51:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-08 11:51:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 433 transitions. [2019-09-08 11:51:10,846 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 433 transitions. Word has length 71 [2019-09-08 11:51:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:10,847 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 433 transitions. [2019-09-08 11:51:10,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:51:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 433 transitions. [2019-09-08 11:51:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:51:10,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:10,848 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] [2019-09-08 11:51:10,849 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1414423564, now seen corresponding path program 1 times [2019-09-08 11:51:10,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:10,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:10,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:10,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:10,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:11,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 11:51:11,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:11,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:51:11,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:51:11,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:51:11,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:51:11,568 INFO L87 Difference]: Start difference. First operand 348 states and 433 transitions. Second operand 17 states. [2019-09-08 11:51:12,209 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:51:12,366 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 11:51:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:13,645 INFO L93 Difference]: Finished difference Result 907 states and 1211 transitions. [2019-09-08 11:51:13,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:51:13,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-09-08 11:51:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:13,648 INFO L225 Difference]: With dead ends: 907 [2019-09-08 11:51:13,648 INFO L226 Difference]: Without dead ends: 775 [2019-09-08 11:51:13,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:51:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-08 11:51:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 336. [2019-09-08 11:51:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-08 11:51:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 417 transitions. [2019-09-08 11:51:13,702 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 417 transitions. Word has length 71 [2019-09-08 11:51:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:13,703 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 417 transitions. [2019-09-08 11:51:13,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:51:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 417 transitions. [2019-09-08 11:51:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:51:13,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:13,704 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] [2019-09-08 11:51:13,705 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:13,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:13,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1732820084, now seen corresponding path program 1 times [2019-09-08 11:51:13,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:13,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:13,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:13,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:13,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:14,241 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 11:51:14,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:14,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:51:14,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:51:14,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:51:14,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:51:14,243 INFO L87 Difference]: Start difference. First operand 336 states and 417 transitions. Second operand 14 states. [2019-09-08 11:51:14,737 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-08 11:51:15,008 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:51:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:16,128 INFO L93 Difference]: Finished difference Result 1024 states and 1368 transitions. [2019-09-08 11:51:16,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:51:16,128 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-08 11:51:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:16,131 INFO L225 Difference]: With dead ends: 1024 [2019-09-08 11:51:16,131 INFO L226 Difference]: Without dead ends: 856 [2019-09-08 11:51:16,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:51:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-09-08 11:51:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 317. [2019-09-08 11:51:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-09-08 11:51:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 395 transitions. [2019-09-08 11:51:16,190 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 395 transitions. Word has length 71 [2019-09-08 11:51:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:16,190 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 395 transitions. [2019-09-08 11:51:16,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:51:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 395 transitions. [2019-09-08 11:51:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:51:16,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:16,191 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] [2019-09-08 11:51:16,192 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1601198802, now seen corresponding path program 1 times [2019-09-08 11:51:16,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:16,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:16,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:17,438 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 11:51:17,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:17,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 11:51:17,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:51:17,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:51:17,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:51:17,439 INFO L87 Difference]: Start difference. First operand 317 states and 395 transitions. Second operand 20 states. [2019-09-08 11:51:17,582 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:51:18,342 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 11:51:18,564 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-09-08 11:51:18,849 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-08 11:51:19,071 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-08 11:51:19,280 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-08 11:51:20,386 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-08 11:51:20,978 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:51:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:21,659 INFO L93 Difference]: Finished difference Result 761 states and 973 transitions. [2019-09-08 11:51:21,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 11:51:21,659 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-09-08 11:51:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:21,662 INFO L225 Difference]: With dead ends: 761 [2019-09-08 11:51:21,662 INFO L226 Difference]: Without dead ends: 652 [2019-09-08 11:51:21,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 11:51:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-09-08 11:51:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 328. [2019-09-08 11:51:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-08 11:51:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 411 transitions. [2019-09-08 11:51:21,717 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 411 transitions. Word has length 72 [2019-09-08 11:51:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:21,717 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 411 transitions. [2019-09-08 11:51:21,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 11:51:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 411 transitions. [2019-09-08 11:51:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:51:21,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:21,719 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] [2019-09-08 11:51:21,719 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:21,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1134979118, now seen corresponding path program 1 times [2019-09-08 11:51:21,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:21,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:21,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:21,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:21,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:22,879 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 11:51:22,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:22,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:51:22,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:51:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:51:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:22,881 INFO L87 Difference]: Start difference. First operand 328 states and 411 transitions. Second operand 21 states. [2019-09-08 11:51:23,013 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 11:51:23,595 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 11:51:23,743 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:51:23,918 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:51:24,171 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 11:51:24,483 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-08 11:51:24,676 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 11:51:24,856 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 11:51:25,035 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 11:51:25,295 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 11:51:25,503 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 11:51:25,673 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:51:25,885 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:51:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:27,127 INFO L93 Difference]: Finished difference Result 630 states and 792 transitions. [2019-09-08 11:51:27,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:51:27,128 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-09-08 11:51:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:27,130 INFO L225 Difference]: With dead ends: 630 [2019-09-08 11:51:27,131 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 11:51:27,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 11:51:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 11:51:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 328. [2019-09-08 11:51:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-08 11:51:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2019-09-08 11:51:27,183 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 72 [2019-09-08 11:51:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:27,183 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2019-09-08 11:51:27,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:51:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2019-09-08 11:51:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:51:27,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:27,184 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] [2019-09-08 11:51:27,184 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash -325456334, now seen corresponding path program 1 times [2019-09-08 11:51:27,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:27,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:27,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:27,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:27,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:27,944 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 11:51:27,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:27,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:51:27,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:51:27,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:51:27,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:51:27,946 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand 17 states. [2019-09-08 11:51:28,553 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:51:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:29,651 INFO L93 Difference]: Finished difference Result 635 states and 828 transitions. [2019-09-08 11:51:29,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:51:29,651 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-09-08 11:51:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:29,653 INFO L225 Difference]: With dead ends: 635 [2019-09-08 11:51:29,653 INFO L226 Difference]: Without dead ends: 494 [2019-09-08 11:51:29,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:51:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-08 11:51:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 307. [2019-09-08 11:51:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-08 11:51:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 383 transitions. [2019-09-08 11:51:29,710 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 383 transitions. Word has length 72 [2019-09-08 11:51:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:29,711 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 383 transitions. [2019-09-08 11:51:29,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:51:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 383 transitions. [2019-09-08 11:51:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:51:29,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:29,712 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] [2019-09-08 11:51:29,712 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:29,712 INFO L82 PathProgramCache]: Analyzing trace with hash -535876087, now seen corresponding path program 1 times [2019-09-08 11:51:29,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:29,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:29,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:29,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:29,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:30,343 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 11:51:30,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:30,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:51:30,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:51:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:51:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:51:30,345 INFO L87 Difference]: Start difference. First operand 307 states and 383 transitions. Second operand 16 states. [2019-09-08 11:51:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:32,267 INFO L93 Difference]: Finished difference Result 1035 states and 1428 transitions. [2019-09-08 11:51:32,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:51:32,267 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-09-08 11:51:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:32,270 INFO L225 Difference]: With dead ends: 1035 [2019-09-08 11:51:32,270 INFO L226 Difference]: Without dead ends: 913 [2019-09-08 11:51:32,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:51:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-09-08 11:51:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 290. [2019-09-08 11:51:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-08 11:51:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 362 transitions. [2019-09-08 11:51:32,325 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 362 transitions. Word has length 72 [2019-09-08 11:51:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:32,325 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 362 transitions. [2019-09-08 11:51:32,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:51:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 362 transitions. [2019-09-08 11:51:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:51:32,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:32,326 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] [2019-09-08 11:51:32,327 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1933470062, now seen corresponding path program 1 times [2019-09-08 11:51:32,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:32,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:32,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:32,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:32,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:51:32,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:51:32,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:51:32,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:51:32,670 INFO L87 Difference]: Start difference. First operand 290 states and 362 transitions. Second operand 11 states. [2019-09-08 11:51:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:33,372 INFO L93 Difference]: Finished difference Result 558 states and 735 transitions. [2019-09-08 11:51:33,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:51:33,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-08 11:51:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:33,376 INFO L225 Difference]: With dead ends: 558 [2019-09-08 11:51:33,376 INFO L226 Difference]: Without dead ends: 554 [2019-09-08 11:51:33,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:51:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-08 11:51:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 286. [2019-09-08 11:51:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-08 11:51:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 358 transitions. [2019-09-08 11:51:33,443 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 358 transitions. Word has length 73 [2019-09-08 11:51:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:33,443 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 358 transitions. [2019-09-08 11:51:33,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:51:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 358 transitions. [2019-09-08 11:51:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:51:33,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:33,444 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] [2019-09-08 11:51:33,444 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:33,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2086852327, now seen corresponding path program 1 times [2019-09-08 11:51:33,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:33,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:33,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:33,966 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 11:51:33,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:33,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:51:33,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:51:33,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:51:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:51:33,968 INFO L87 Difference]: Start difference. First operand 286 states and 358 transitions. Second operand 12 states. [2019-09-08 11:51:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:35,297 INFO L93 Difference]: Finished difference Result 1325 states and 1865 transitions. [2019-09-08 11:51:35,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:51:35,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 11:51:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:35,301 INFO L225 Difference]: With dead ends: 1325 [2019-09-08 11:51:35,301 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 11:51:35,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:51:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 11:51:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 252. [2019-09-08 11:51:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-08 11:51:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 315 transitions. [2019-09-08 11:51:35,371 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 315 transitions. Word has length 73 [2019-09-08 11:51:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:35,371 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 315 transitions. [2019-09-08 11:51:35,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:51:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 315 transitions. [2019-09-08 11:51:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:51:35,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:35,372 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] [2019-09-08 11:51:35,372 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:35,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1799415509, now seen corresponding path program 1 times [2019-09-08 11:51:35,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:35,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:35,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:37,121 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 11:51:37,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:37,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:51:37,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:51:37,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:51:37,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:37,122 INFO L87 Difference]: Start difference. First operand 252 states and 315 transitions. Second operand 21 states. [2019-09-08 11:51:37,327 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 11:51:37,675 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-08 11:51:37,848 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:51:38,060 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-08 11:51:38,421 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 11:51:38,752 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 11:51:39,179 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-08 11:51:39,589 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-08 11:51:40,000 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-08 11:51:40,418 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-08 11:51:40,931 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-09-08 11:51:41,295 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:51:41,661 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 11:51:41,906 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 11:51:42,173 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-08 11:51:42,634 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 11:51:43,008 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 11:51:43,322 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:51:43,498 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 11:51:43,890 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 11:51:44,750 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 11:51:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:45,766 INFO L93 Difference]: Finished difference Result 1060 states and 1441 transitions. [2019-09-08 11:51:45,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:51:45,766 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 73 [2019-09-08 11:51:45,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:45,770 INFO L225 Difference]: With dead ends: 1060 [2019-09-08 11:51:45,770 INFO L226 Difference]: Without dead ends: 951 [2019-09-08 11:51:45,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=417, Invalid=1475, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 11:51:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-08 11:51:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 248. [2019-09-08 11:51:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-08 11:51:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 310 transitions. [2019-09-08 11:51:45,868 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 310 transitions. Word has length 73 [2019-09-08 11:51:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:45,868 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 310 transitions. [2019-09-08 11:51:45,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:51:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 310 transitions. [2019-09-08 11:51:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:51:45,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:45,869 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] [2019-09-08 11:51:45,869 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:45,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1717982386, now seen corresponding path program 1 times [2019-09-08 11:51:45,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:45,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:45,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:45,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:46,002 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 11:51:46,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:46,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:46,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:46,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:46,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:46,004 INFO L87 Difference]: Start difference. First operand 248 states and 310 transitions. Second operand 9 states. [2019-09-08 11:51:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:46,650 INFO L93 Difference]: Finished difference Result 526 states and 696 transitions. [2019-09-08 11:51:46,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:51:46,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-08 11:51:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:46,652 INFO L225 Difference]: With dead ends: 526 [2019-09-08 11:51:46,652 INFO L226 Difference]: Without dead ends: 393 [2019-09-08 11:51:46,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:51:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-08 11:51:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 248. [2019-09-08 11:51:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-08 11:51:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 309 transitions. [2019-09-08 11:51:46,728 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 309 transitions. Word has length 74 [2019-09-08 11:51:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:46,728 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 309 transitions. [2019-09-08 11:51:46,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 309 transitions. [2019-09-08 11:51:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:51:46,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:46,729 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] [2019-09-08 11:51:46,730 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2063860178, now seen corresponding path program 1 times [2019-09-08 11:51:46,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:46,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:46,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:46,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:46,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:46,905 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 11:51:46,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:46,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:46,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:46,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:46,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:46,907 INFO L87 Difference]: Start difference. First operand 248 states and 309 transitions. Second operand 9 states. [2019-09-08 11:51:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:48,014 INFO L93 Difference]: Finished difference Result 517 states and 682 transitions. [2019-09-08 11:51:48,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:51:48,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:51:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:48,017 INFO L225 Difference]: With dead ends: 517 [2019-09-08 11:51:48,017 INFO L226 Difference]: Without dead ends: 509 [2019-09-08 11:51:48,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:51:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-09-08 11:51:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 248. [2019-09-08 11:51:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-08 11:51:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 308 transitions. [2019-09-08 11:51:48,078 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 308 transitions. Word has length 75 [2019-09-08 11:51:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:48,078 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 308 transitions. [2019-09-08 11:51:48,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 308 transitions. [2019-09-08 11:51:48,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:51:48,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:48,079 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] [2019-09-08 11:51:48,079 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:48,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1495566453, now seen corresponding path program 1 times [2019-09-08 11:51:48,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:48,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:48,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:48,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:48,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:48,221 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 11:51:48,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:48,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:48,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:48,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:48,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:48,222 INFO L87 Difference]: Start difference. First operand 248 states and 308 transitions. Second operand 9 states. [2019-09-08 11:51:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:49,142 INFO L93 Difference]: Finished difference Result 410 states and 523 transitions. [2019-09-08 11:51:49,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:51:49,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:51:49,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:49,144 INFO L225 Difference]: With dead ends: 410 [2019-09-08 11:51:49,144 INFO L226 Difference]: Without dead ends: 402 [2019-09-08 11:51:49,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:51:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-08 11:51:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 248. [2019-09-08 11:51:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-08 11:51:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 307 transitions. [2019-09-08 11:51:49,212 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 307 transitions. Word has length 75 [2019-09-08 11:51:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:49,213 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 307 transitions. [2019-09-08 11:51:49,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 307 transitions. [2019-09-08 11:51:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:51:49,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:49,213 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] [2019-09-08 11:51:49,214 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1970985129, now seen corresponding path program 1 times [2019-09-08 11:51:49,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:49,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:49,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:49,831 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 11:51:49,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:49,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:51:49,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:51:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:51:49,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:49,833 INFO L87 Difference]: Start difference. First operand 248 states and 307 transitions. Second operand 21 states. [2019-09-08 11:51:50,001 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-08 11:51:50,810 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 11:51:50,978 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 11:51:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:54,923 INFO L93 Difference]: Finished difference Result 1320 states and 1823 transitions. [2019-09-08 11:51:54,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:51:54,924 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-08 11:51:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:54,928 INFO L225 Difference]: With dead ends: 1320 [2019-09-08 11:51:54,928 INFO L226 Difference]: Without dead ends: 1201 [2019-09-08 11:51:54,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:51:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-09-08 11:51:54,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 267. [2019-09-08 11:51:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-08 11:51:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 329 transitions. [2019-09-08 11:51:54,998 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 329 transitions. Word has length 76 [2019-09-08 11:51:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:54,998 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 329 transitions. [2019-09-08 11:51:54,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:51:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 329 transitions. [2019-09-08 11:51:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:51:54,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:54,999 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] [2019-09-08 11:51:54,999 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1254231081, now seen corresponding path program 1 times [2019-09-08 11:51:55,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:55,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:55,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:55,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:55,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:55,446 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 11:51:55,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:55,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:51:55,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:51:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:51:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:51:55,447 INFO L87 Difference]: Start difference. First operand 267 states and 329 transitions. Second operand 12 states. [2019-09-08 11:51:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:56,442 INFO L93 Difference]: Finished difference Result 635 states and 853 transitions. [2019-09-08 11:51:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:51:56,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2019-09-08 11:51:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:56,445 INFO L225 Difference]: With dead ends: 635 [2019-09-08 11:51:56,445 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 11:51:56,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:51:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 11:51:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 260. [2019-09-08 11:51:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-08 11:51:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 322 transitions. [2019-09-08 11:51:56,519 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 322 transitions. Word has length 77 [2019-09-08 11:51:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:56,519 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 322 transitions. [2019-09-08 11:51:56,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:51:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 322 transitions. [2019-09-08 11:51:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:51:56,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:56,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:56,521 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:56,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1521511757, now seen corresponding path program 1 times [2019-09-08 11:51:56,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:56,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:56,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:56,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:56,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:57,015 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 11:51:57,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:57,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:51:57,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:51:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:51:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:51:57,018 INFO L87 Difference]: Start difference. First operand 260 states and 322 transitions. Second operand 13 states. [2019-09-08 11:51:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:58,779 INFO L93 Difference]: Finished difference Result 870 states and 1196 transitions. [2019-09-08 11:51:58,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:51:58,783 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-09-08 11:51:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:58,787 INFO L225 Difference]: With dead ends: 870 [2019-09-08 11:51:58,787 INFO L226 Difference]: Without dead ends: 850 [2019-09-08 11:51:58,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:51:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-09-08 11:51:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 240. [2019-09-08 11:51:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-08 11:51:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 301 transitions. [2019-09-08 11:51:58,864 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 301 transitions. Word has length 77 [2019-09-08 11:51:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:58,864 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 301 transitions. [2019-09-08 11:51:58,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:51:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 301 transitions. [2019-09-08 11:51:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:51:58,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:58,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:58,866 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:58,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2017824198, now seen corresponding path program 1 times [2019-09-08 11:51:58,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:58,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:58,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:58,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:58,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:00,163 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 11:52:00,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:00,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 11:52:00,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 11:52:00,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 11:52:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:52:00,165 INFO L87 Difference]: Start difference. First operand 240 states and 301 transitions. Second operand 22 states. [2019-09-08 11:52:00,323 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 11:52:00,837 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 11:52:01,028 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-08 11:52:01,259 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-09-08 11:52:01,469 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-08 11:52:01,710 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-09-08 11:52:01,928 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-08 11:52:02,141 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-08 11:52:02,364 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-08 11:52:02,581 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-08 11:52:02,757 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 11:52:02,934 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:52:03,290 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 11:52:03,992 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 11:52:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:06,849 INFO L93 Difference]: Finished difference Result 1208 states and 1684 transitions. [2019-09-08 11:52:06,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:52:06,850 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-09-08 11:52:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:06,854 INFO L225 Difference]: With dead ends: 1208 [2019-09-08 11:52:06,854 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 11:52:06,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 11:52:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 11:52:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 246. [2019-09-08 11:52:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-08 11:52:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 307 transitions. [2019-09-08 11:52:06,934 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 307 transitions. Word has length 77 [2019-09-08 11:52:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:06,935 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 307 transitions. [2019-09-08 11:52:06,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 11:52:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 307 transitions. [2019-09-08 11:52:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:52:06,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:06,936 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] [2019-09-08 11:52:06,936 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:06,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:06,937 INFO L82 PathProgramCache]: Analyzing trace with hash -426565732, now seen corresponding path program 1 times [2019-09-08 11:52:06,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:06,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:06,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:06,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:06,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:07,248 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 11:52:07,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:07,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:52:07,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:52:07,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:52:07,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:52:07,249 INFO L87 Difference]: Start difference. First operand 246 states and 307 transitions. Second operand 10 states. [2019-09-08 11:52:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:08,525 INFO L93 Difference]: Finished difference Result 754 states and 1046 transitions. [2019-09-08 11:52:08,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:52:08,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-09-08 11:52:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:08,528 INFO L225 Difference]: With dead ends: 754 [2019-09-08 11:52:08,528 INFO L226 Difference]: Without dead ends: 721 [2019-09-08 11:52:08,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:52:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-09-08 11:52:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 213. [2019-09-08 11:52:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-08 11:52:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 272 transitions. [2019-09-08 11:52:08,599 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 272 transitions. Word has length 78 [2019-09-08 11:52:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:08,599 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 272 transitions. [2019-09-08 11:52:08,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:52:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2019-09-08 11:52:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:52:08,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:08,601 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:08,601 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash 123664725, now seen corresponding path program 1 times [2019-09-08 11:52:08,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:08,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:08,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:08,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:08,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:08,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:08,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:08,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:08,676 INFO L87 Difference]: Start difference. First operand 213 states and 272 transitions. Second operand 3 states. [2019-09-08 11:52:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:08,862 INFO L93 Difference]: Finished difference Result 415 states and 568 transitions. [2019-09-08 11:52:08,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:08,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:52:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:08,863 INFO L225 Difference]: With dead ends: 415 [2019-09-08 11:52:08,863 INFO L226 Difference]: Without dead ends: 310 [2019-09-08 11:52:08,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-08 11:52:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-09-08 11:52:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-08 11:52:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 409 transitions. [2019-09-08 11:52:08,980 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 409 transitions. Word has length 100 [2019-09-08 11:52:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:08,980 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 409 transitions. [2019-09-08 11:52:08,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 409 transitions. [2019-09-08 11:52:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:08,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:08,981 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:08,982 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:08,982 INFO L82 PathProgramCache]: Analyzing trace with hash 584012325, now seen corresponding path program 1 times [2019-09-08 11:52:08,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:08,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:08,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:08,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:08,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:09,036 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 11:52:09,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:09,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:09,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:09,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:09,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:09,038 INFO L87 Difference]: Start difference. First operand 308 states and 409 transitions. Second operand 3 states. [2019-09-08 11:52:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:09,297 INFO L93 Difference]: Finished difference Result 688 states and 959 transitions. [2019-09-08 11:52:09,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:09,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:52:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:09,300 INFO L225 Difference]: With dead ends: 688 [2019-09-08 11:52:09,300 INFO L226 Difference]: Without dead ends: 488 [2019-09-08 11:52:09,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-08 11:52:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 486. [2019-09-08 11:52:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-09-08 11:52:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 661 transitions. [2019-09-08 11:52:09,538 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 661 transitions. Word has length 102 [2019-09-08 11:52:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:09,539 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 661 transitions. [2019-09-08 11:52:09,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 661 transitions. [2019-09-08 11:52:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:09,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:09,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:09,541 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:09,541 INFO L82 PathProgramCache]: Analyzing trace with hash 650505837, now seen corresponding path program 1 times [2019-09-08 11:52:09,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:09,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:09,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:09,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:09,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:09,606 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 11:52:09,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:09,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:09,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:09,607 INFO L87 Difference]: Start difference. First operand 486 states and 661 transitions. Second operand 3 states. [2019-09-08 11:52:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:10,255 INFO L93 Difference]: Finished difference Result 1058 states and 1483 transitions. [2019-09-08 11:52:10,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:10,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:52:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:10,259 INFO L225 Difference]: With dead ends: 1058 [2019-09-08 11:52:10,259 INFO L226 Difference]: Without dead ends: 680 [2019-09-08 11:52:10,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-08 11:52:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 678. [2019-09-08 11:52:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-09-08 11:52:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 933 transitions. [2019-09-08 11:52:10,569 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 933 transitions. Word has length 102 [2019-09-08 11:52:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:10,569 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 933 transitions. [2019-09-08 11:52:10,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 933 transitions. [2019-09-08 11:52:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:10,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:10,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:10,571 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash 184976012, now seen corresponding path program 1 times [2019-09-08 11:52:10,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:10,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:10,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:10,633 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 11:52:10,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:10,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:52:10,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:52:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:52:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:52:10,634 INFO L87 Difference]: Start difference. First operand 678 states and 933 transitions. Second operand 5 states. [2019-09-08 11:52:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:12,063 INFO L93 Difference]: Finished difference Result 2934 states and 4129 transitions. [2019-09-08 11:52:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:52:12,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:52:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:12,072 INFO L225 Difference]: With dead ends: 2934 [2019-09-08 11:52:12,072 INFO L226 Difference]: Without dead ends: 2364 [2019-09-08 11:52:12,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:52:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2019-09-08 11:52:12,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 1294. [2019-09-08 11:52:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-09-08 11:52:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1797 transitions. [2019-09-08 11:52:12,669 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1797 transitions. Word has length 102 [2019-09-08 11:52:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:12,669 INFO L475 AbstractCegarLoop]: Abstraction has 1294 states and 1797 transitions. [2019-09-08 11:52:12,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:52:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1797 transitions. [2019-09-08 11:52:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:12,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:12,671 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:12,671 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2060125324, now seen corresponding path program 1 times [2019-09-08 11:52:12,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:12,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:12,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:12,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:12,734 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 11:52:12,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:12,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:52:12,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:52:12,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:52:12,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:52:12,735 INFO L87 Difference]: Start difference. First operand 1294 states and 1797 transitions. Second operand 5 states. [2019-09-08 11:52:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:14,944 INFO L93 Difference]: Finished difference Result 5274 states and 7405 transitions. [2019-09-08 11:52:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:52:14,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:52:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:14,953 INFO L225 Difference]: With dead ends: 5274 [2019-09-08 11:52:14,953 INFO L226 Difference]: Without dead ends: 4088 [2019-09-08 11:52:14,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:52:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2019-09-08 11:52:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 2574. [2019-09-08 11:52:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2019-09-08 11:52:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 3573 transitions. [2019-09-08 11:52:16,218 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 3573 transitions. Word has length 102 [2019-09-08 11:52:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:16,218 INFO L475 AbstractCegarLoop]: Abstraction has 2574 states and 3573 transitions. [2019-09-08 11:52:16,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:52:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3573 transitions. [2019-09-08 11:52:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:16,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:16,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:16,223 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:16,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1870756212, now seen corresponding path program 1 times [2019-09-08 11:52:16,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:16,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:16,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:16,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:16,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:16,292 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 11:52:16,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:16,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:52:16,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:52:16,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:52:16,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:52:16,293 INFO L87 Difference]: Start difference. First operand 2574 states and 3573 transitions. Second operand 5 states. [2019-09-08 11:52:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:19,829 INFO L93 Difference]: Finished difference Result 9423 states and 13154 transitions. [2019-09-08 11:52:19,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:52:19,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:52:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:19,844 INFO L225 Difference]: With dead ends: 9423 [2019-09-08 11:52:19,844 INFO L226 Difference]: Without dead ends: 6957 [2019-09-08 11:52:19,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:52:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-09-08 11:52:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 4162. [2019-09-08 11:52:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-09-08 11:52:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 5737 transitions. [2019-09-08 11:52:21,952 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 5737 transitions. Word has length 102 [2019-09-08 11:52:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:21,952 INFO L475 AbstractCegarLoop]: Abstraction has 4162 states and 5737 transitions. [2019-09-08 11:52:21,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:52:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 5737 transitions. [2019-09-08 11:52:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:21,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:21,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:21,954 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1130297204, now seen corresponding path program 1 times [2019-09-08 11:52:21,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:21,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:21,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:22,024 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 11:52:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:22,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:52:22,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:52:22,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:52:22,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:52:22,026 INFO L87 Difference]: Start difference. First operand 4162 states and 5737 transitions. Second operand 5 states. [2019-09-08 11:52:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:26,713 INFO L93 Difference]: Finished difference Result 12970 states and 17757 transitions. [2019-09-08 11:52:26,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:52:26,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:52:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:26,734 INFO L225 Difference]: With dead ends: 12970 [2019-09-08 11:52:26,735 INFO L226 Difference]: Without dead ends: 8916 [2019-09-08 11:52:26,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:52:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8916 states. [2019-09-08 11:52:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8916 to 5166. [2019-09-08 11:52:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2019-09-08 11:52:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 6985 transitions. [2019-09-08 11:52:29,561 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 6985 transitions. Word has length 102 [2019-09-08 11:52:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:29,561 INFO L475 AbstractCegarLoop]: Abstraction has 5166 states and 6985 transitions. [2019-09-08 11:52:29,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:52:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 6985 transitions. [2019-09-08 11:52:29,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:52:29,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:29,562 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:29,562 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash 946884168, now seen corresponding path program 1 times [2019-09-08 11:52:29,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:29,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:29,619 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 11:52:29,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:29,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:29,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:29,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:29,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:29,620 INFO L87 Difference]: Start difference. First operand 5166 states and 6985 transitions. Second operand 3 states. [2019-09-08 11:52:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:32,257 INFO L93 Difference]: Finished difference Result 9938 states and 13423 transitions. [2019-09-08 11:52:32,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:32,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 11:52:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:32,271 INFO L225 Difference]: With dead ends: 9938 [2019-09-08 11:52:32,271 INFO L226 Difference]: Without dead ends: 4880 [2019-09-08 11:52:32,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2019-09-08 11:52:34,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 3722. [2019-09-08 11:52:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3722 states. [2019-09-08 11:52:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 4926 transitions. [2019-09-08 11:52:34,364 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 4926 transitions. Word has length 103 [2019-09-08 11:52:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:34,364 INFO L475 AbstractCegarLoop]: Abstraction has 3722 states and 4926 transitions. [2019-09-08 11:52:34,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 4926 transitions. [2019-09-08 11:52:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:52:34,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:34,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:34,366 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:34,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:34,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1583660251, now seen corresponding path program 1 times [2019-09-08 11:52:34,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:34,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:34,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:34,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:34,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:34,418 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 11:52:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:34,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:34,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:34,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:34,420 INFO L87 Difference]: Start difference. First operand 3722 states and 4926 transitions. Second operand 3 states. [2019-09-08 11:52:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:36,324 INFO L93 Difference]: Finished difference Result 7194 states and 9521 transitions. [2019-09-08 11:52:36,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:36,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 11:52:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:36,333 INFO L225 Difference]: With dead ends: 7194 [2019-09-08 11:52:36,333 INFO L226 Difference]: Without dead ends: 3580 [2019-09-08 11:52:36,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2019-09-08 11:52:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3260. [2019-09-08 11:52:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3260 states. [2019-09-08 11:52:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 4266 transitions. [2019-09-08 11:52:38,145 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 4266 transitions. Word has length 104 [2019-09-08 11:52:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:38,145 INFO L475 AbstractCegarLoop]: Abstraction has 3260 states and 4266 transitions. [2019-09-08 11:52:38,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 4266 transitions. [2019-09-08 11:52:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:52:38,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:38,146 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:38,147 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1318773056, now seen corresponding path program 1 times [2019-09-08 11:52:38,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:38,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:38,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:38,200 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 11:52:38,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:38,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:38,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:38,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:38,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:38,201 INFO L87 Difference]: Start difference. First operand 3260 states and 4266 transitions. Second operand 3 states. [2019-09-08 11:52:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:40,067 INFO L93 Difference]: Finished difference Result 6742 states and 8862 transitions. [2019-09-08 11:52:40,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:40,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 11:52:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:40,072 INFO L225 Difference]: With dead ends: 6742 [2019-09-08 11:52:40,072 INFO L226 Difference]: Without dead ends: 3590 [2019-09-08 11:52:40,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2019-09-08 11:52:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3588. [2019-09-08 11:52:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-09-08 11:52:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 4669 transitions. [2019-09-08 11:52:41,945 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 4669 transitions. Word has length 105 [2019-09-08 11:52:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:41,945 INFO L475 AbstractCegarLoop]: Abstraction has 3588 states and 4669 transitions. [2019-09-08 11:52:41,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 4669 transitions. [2019-09-08 11:52:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:52:41,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:41,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:41,946 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1379426431, now seen corresponding path program 1 times [2019-09-08 11:52:41,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:41,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:41,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:41,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:41,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:42,031 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 11:52:42,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:42,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:52:42,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:52:42,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:52:42,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:52:42,033 INFO L87 Difference]: Start difference. First operand 3588 states and 4669 transitions. Second operand 6 states. [2019-09-08 11:52:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:44,987 INFO L93 Difference]: Finished difference Result 5322 states and 6890 transitions. [2019-09-08 11:52:44,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:52:44,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-08 11:52:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:44,992 INFO L225 Difference]: With dead ends: 5322 [2019-09-08 11:52:44,992 INFO L226 Difference]: Without dead ends: 5320 [2019-09-08 11:52:44,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:52:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2019-09-08 11:52:46,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 3642. [2019-09-08 11:52:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-09-08 11:52:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4705 transitions. [2019-09-08 11:52:46,880 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4705 transitions. Word has length 105 [2019-09-08 11:52:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:46,880 INFO L475 AbstractCegarLoop]: Abstraction has 3642 states and 4705 transitions. [2019-09-08 11:52:46,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:52:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4705 transitions. [2019-09-08 11:52:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 11:52:46,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:46,883 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:46,883 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:46,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1107526132, now seen corresponding path program 1 times [2019-09-08 11:52:46,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:46,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:46,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:46,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:46,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 11:52:46,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:46,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:46,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:46,960 INFO L87 Difference]: Start difference. First operand 3642 states and 4705 transitions. Second operand 3 states. [2019-09-08 11:52:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:49,387 INFO L93 Difference]: Finished difference Result 7982 states and 10311 transitions. [2019-09-08 11:52:49,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:49,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 11:52:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:49,391 INFO L225 Difference]: With dead ends: 7982 [2019-09-08 11:52:49,391 INFO L226 Difference]: Without dead ends: 4448 [2019-09-08 11:52:49,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2019-09-08 11:52:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4286. [2019-09-08 11:52:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4286 states. [2019-09-08 11:52:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5501 transitions. [2019-09-08 11:52:51,659 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5501 transitions. Word has length 131 [2019-09-08 11:52:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:51,659 INFO L475 AbstractCegarLoop]: Abstraction has 4286 states and 5501 transitions. [2019-09-08 11:52:51,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5501 transitions. [2019-09-08 11:52:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:52:51,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:51,661 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:51,661 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:51,662 INFO L82 PathProgramCache]: Analyzing trace with hash -965154483, now seen corresponding path program 1 times [2019-09-08 11:52:51,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:51,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:51,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:51,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 11:52:51,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:51,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:52:51,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:52:51,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:52:51,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:52:51,778 INFO L87 Difference]: Start difference. First operand 4286 states and 5501 transitions. Second operand 6 states. [2019-09-08 11:53:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:53:01,054 INFO L93 Difference]: Finished difference Result 20916 states and 26800 transitions. [2019-09-08 11:53:01,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:53:01,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-08 11:53:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:53:01,069 INFO L225 Difference]: With dead ends: 20916 [2019-09-08 11:53:01,069 INFO L226 Difference]: Without dead ends: 16738 [2019-09-08 11:53:01,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:53:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16738 states. [2019-09-08 11:53:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16738 to 6966. [2019-09-08 11:53:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-09-08 11:53:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 8889 transitions. [2019-09-08 11:53:05,011 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 8889 transitions. Word has length 132 [2019-09-08 11:53:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:53:05,011 INFO L475 AbstractCegarLoop]: Abstraction has 6966 states and 8889 transitions. [2019-09-08 11:53:05,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:53:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 8889 transitions. [2019-09-08 11:53:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:53:05,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:53:05,013 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:05,013 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:53:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:53:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash 909994829, now seen corresponding path program 1 times [2019-09-08 11:53:05,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:53:05,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:53:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:05,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:05,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:53:05,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:53:05,126 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:53:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:05,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:53:05,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:53:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 11:53:05,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:53:05,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:53:05,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:53:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:53:05,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:53:05,521 INFO L87 Difference]: Start difference. First operand 6966 states and 8889 transitions. Second operand 10 states. [2019-09-08 11:53:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:53:24,179 INFO L93 Difference]: Finished difference Result 36264 states and 46594 transitions. [2019-09-08 11:53:24,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:53:24,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2019-09-08 11:53:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:53:24,291 INFO L225 Difference]: With dead ends: 36264 [2019-09-08 11:53:24,291 INFO L226 Difference]: Without dead ends: 32086 [2019-09-08 11:53:24,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:53:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32086 states. [2019-09-08 11:53:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32086 to 9646. [2019-09-08 11:53:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9646 states. [2019-09-08 11:53:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9646 states to 9646 states and 12277 transitions. [2019-09-08 11:53:30,223 INFO L78 Accepts]: Start accepts. Automaton has 9646 states and 12277 transitions. Word has length 132 [2019-09-08 11:53:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:53:30,223 INFO L475 AbstractCegarLoop]: Abstraction has 9646 states and 12277 transitions. [2019-09-08 11:53:30,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:53:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 9646 states and 12277 transitions. [2019-09-08 11:53:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 11:53:30,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:53:30,227 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:30,227 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:53:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:53:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1274080589, now seen corresponding path program 1 times [2019-09-08 11:53:30,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:53:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:53:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:30,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:53:30,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:53:30,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:53:30,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:53:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:30,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:53:30,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:53:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 11:53:30,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:53:30,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:53:30,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:53:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:53:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:53:30,827 INFO L87 Difference]: Start difference. First operand 9646 states and 12277 transitions. Second operand 10 states. [2019-09-08 11:53:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:53:59,233 INFO L93 Difference]: Finished difference Result 56198 states and 71737 transitions. [2019-09-08 11:53:59,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:53:59,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2019-09-08 11:53:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:53:59,392 INFO L225 Difference]: With dead ends: 56198 [2019-09-08 11:53:59,393 INFO L226 Difference]: Without dead ends: 49340 [2019-09-08 11:53:59,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:53:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49340 states. [2019-09-08 11:54:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49340 to 19974. [2019-09-08 11:54:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19974 states. [2019-09-08 11:54:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19974 states to 19974 states and 25453 transitions. [2019-09-08 11:54:11,289 INFO L78 Accepts]: Start accepts. Automaton has 19974 states and 25453 transitions. Word has length 132 [2019-09-08 11:54:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:54:11,289 INFO L475 AbstractCegarLoop]: Abstraction has 19974 states and 25453 transitions. [2019-09-08 11:54:11,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:54:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 19974 states and 25453 transitions. [2019-09-08 11:54:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 11:54:11,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:54:11,293 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:54:11,294 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:54:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:54:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash -347422809, now seen corresponding path program 1 times [2019-09-08 11:54:11,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:54:11,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:54:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:54:11,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:54:11,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:54:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:54:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:54:11,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:54:11,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:54:11,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:54:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:54:11,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:54:12,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:54:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 11:54:12,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:54:12,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-09-08 11:54:12,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:54:12,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:54:12,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:54:12,144 INFO L87 Difference]: Start difference. First operand 19974 states and 25453 transitions. Second operand 15 states. [2019-09-08 11:55:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:21,106 INFO L93 Difference]: Finished difference Result 120157 states and 149860 transitions. [2019-09-08 11:55:21,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-08 11:55:21,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 133 [2019-09-08 11:55:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:21,258 INFO L225 Difference]: With dead ends: 120157 [2019-09-08 11:55:21,259 INFO L226 Difference]: Without dead ends: 100291 [2019-09-08 11:55:21,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1861 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1459, Invalid=4703, Unknown=0, NotChecked=0, Total=6162 [2019-09-08 11:55:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100291 states. [2019-09-08 11:55:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100291 to 59237. [2019-09-08 11:55:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59237 states. [2019-09-08 11:55:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59237 states to 59237 states and 74118 transitions. [2019-09-08 11:55:58,928 INFO L78 Accepts]: Start accepts. Automaton has 59237 states and 74118 transitions. Word has length 133 [2019-09-08 11:55:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:58,928 INFO L475 AbstractCegarLoop]: Abstraction has 59237 states and 74118 transitions. [2019-09-08 11:55:58,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:55:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 59237 states and 74118 transitions. [2019-09-08 11:55:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 11:55:58,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:58,933 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:55:58,933 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2146454166, now seen corresponding path program 1 times [2019-09-08 11:55:58,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:58,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:58,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:58,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:55:59,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:55:59,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:55:59,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:59,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:55:59,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:55:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 11:55:59,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:55:59,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:55:59,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:55:59,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:55:59,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:55:59,394 INFO L87 Difference]: Start difference. First operand 59237 states and 74118 transitions. Second operand 10 states. [2019-09-08 11:57:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:57:14,072 INFO L93 Difference]: Finished difference Result 175379 states and 220001 transitions. [2019-09-08 11:57:14,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:57:14,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2019-09-08 11:57:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:57:14,207 INFO L225 Difference]: With dead ends: 175379 [2019-09-08 11:57:14,207 INFO L226 Difference]: Without dead ends: 124273 [2019-09-08 11:57:14,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:57:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124273 states. [2019-09-08 11:58:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124273 to 82437. [2019-09-08 11:58:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82437 states. [2019-09-08 11:58:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82437 states to 82437 states and 103054 transitions. [2019-09-08 11:58:05,796 INFO L78 Accepts]: Start accepts. Automaton has 82437 states and 103054 transitions. Word has length 134 [2019-09-08 11:58:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:05,796 INFO L475 AbstractCegarLoop]: Abstraction has 82437 states and 103054 transitions. [2019-09-08 11:58:05,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:58:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 82437 states and 103054 transitions. [2019-09-08 11:58:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 11:58:05,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:05,802 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:05,802 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:05,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1293882900, now seen corresponding path program 1 times [2019-09-08 11:58:05,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:05,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:05,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:05,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:05,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 11:58:05,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:05,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:05,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:05,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:05,965 INFO L87 Difference]: Start difference. First operand 82437 states and 103054 transitions. Second operand 9 states. [2019-09-08 11:59:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:21,231 INFO L93 Difference]: Finished difference Result 205399 states and 257054 transitions. [2019-09-08 11:59:21,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:59:21,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 11:59:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:21,378 INFO L225 Difference]: With dead ends: 205399 [2019-09-08 11:59:21,378 INFO L226 Difference]: Without dead ends: 123079 [2019-09-08 11:59:21,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:59:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123079 states. [2019-09-08 12:00:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123079 to 82437. [2019-09-08 12:00:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82437 states. [2019-09-08 12:00:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82437 states to 82437 states and 103051 transitions. [2019-09-08 12:00:14,589 INFO L78 Accepts]: Start accepts. Automaton has 82437 states and 103051 transitions. Word has length 135 [2019-09-08 12:00:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:14,589 INFO L475 AbstractCegarLoop]: Abstraction has 82437 states and 103051 transitions. [2019-09-08 12:00:14,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:00:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 82437 states and 103051 transitions. [2019-09-08 12:00:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:00:14,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:14,596 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:00:14,596 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:14,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:14,596 INFO L82 PathProgramCache]: Analyzing trace with hash 445688151, now seen corresponding path program 1 times [2019-09-08 12:00:14,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:14,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:14,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:14,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:14,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:00:14,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:00:14,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:00:14,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:00:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:15,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1511 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 12:00:15,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:00:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:00:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:00:16,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:00:16,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-08 12:00:16,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:00:16,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:00:16,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:00:16,009 INFO L87 Difference]: Start difference. First operand 82437 states and 103051 transitions. Second operand 21 states. [2019-09-08 12:00:19,244 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-08 12:00:19,405 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-09-08 12:00:20,045 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-08 12:00:20,710 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:00:21,540 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-08 12:00:21,944 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-08 12:00:22,423 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:00:23,005 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-08 12:00:23,162 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-08 12:00:23,994 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 12:00:25,031 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:00:25,194 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:00:25,957 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-08 12:00:26,260 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-08 12:00:27,815 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-08 12:00:28,006 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-09-08 12:00:29,557 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-08 12:00:29,775 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-08 12:00:29,961 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:00:30,131 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 12:00:30,310 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-08 12:00:30,489 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-09-08 12:00:30,911 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-08 12:00:31,771 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-08 12:00:32,107 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-08 12:00:32,271 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-08 12:00:32,441 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-08 12:00:32,627 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-08 12:00:32,815 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-08 12:00:33,548 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 12:00:34,627 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-08 12:00:34,926 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-08 12:00:35,225 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:00:35,532 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:00:36,242 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:00:37,740 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 12:00:39,520 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-08 12:00:39,698 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-08 12:00:39,909 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-08 12:00:40,062 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 43 [2019-09-08 12:00:43,320 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-08 12:00:43,478 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-08 12:00:43,926 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-08 12:00:44,082 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-08 12:00:44,234 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-08 12:00:44,376 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-08 12:00:44,566 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-08 12:00:44,929 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-08 12:00:45,092 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-08 12:00:45,314 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-08 12:00:45,477 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-08 12:00:48,385 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-08 12:00:48,955 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-08 12:00:49,583 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:00:49,752 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-08 12:00:50,202 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-08 12:01:17,061 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-08 12:01:17,747 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-09-08 12:01:17,893 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-09-08 12:01:21,025 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-09-08 12:01:21,159 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-08 12:01:21,323 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 12:01:21,639 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-08 12:01:21,802 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:01:21,949 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-08 12:01:22,134 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-08 12:01:22,833 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-08 12:01:24,356 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-08 12:01:25,123 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-08 12:01:25,549 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-08 12:01:26,338 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-08 12:01:26,478 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-08 12:01:26,657 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:01:27,538 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-08 12:01:27,729 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-08 12:01:27,942 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:01:28,109 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-09-08 12:01:28,373 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-08 12:01:28,617 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-08 12:01:28,843 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-08 12:01:30,999 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-08 12:01:31,304 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-08 12:01:31,723 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-09-08 12:01:32,066 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-08 12:01:32,489 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-08 12:01:32,684 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-08 12:01:36,032 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-08 12:01:36,294 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:01:36,509 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2019-09-08 12:01:39,652 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-09-08 12:01:40,001 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-08 12:01:46,127 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2019-09-08 12:01:46,323 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-09-08 12:01:46,736 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-08 12:01:49,452 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-08 12:01:50,157 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-08 12:01:50,395 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-08 12:01:50,638 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-08 12:01:50,843 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-09-08 12:01:51,023 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-09-08 12:01:54,136 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-08 12:01:54,283 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-08 12:01:54,543 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:01:54,712 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-09-08 12:01:54,870 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-08 12:01:55,010 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-08 12:01:55,236 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-08 12:01:57,682 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-09-08 12:01:57,866 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-08 12:01:58,556 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-08 12:02:00,951 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 12:02:01,175 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-08 12:02:01,696 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:02:01,964 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-08 12:02:02,209 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:02:02,367 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-08 12:02:02,523 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-08 12:02:05,826 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-08 12:02:05,989 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-08 12:02:06,271 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-08 12:02:06,505 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-08 12:02:06,662 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-08 12:02:06,904 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-09-08 12:02:11,169 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-08 12:02:13,555 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50