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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:58:29,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:58:29,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:58:29,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:58:29,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:58:29,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:58:29,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:58:29,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:58:29,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:58:29,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:58:29,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:58:29,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:58:29,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:58:29,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:58:29,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:58:29,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:58:29,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:58:29,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:58:29,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:58:29,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:58:29,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:58:29,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:58:29,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:58:29,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:58:29,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:58:29,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:58:29,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:58:29,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:58:29,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:58:29,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:58:29,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:58:29,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:58:29,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:58:29,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:58:29,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:58:29,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:58:29,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:58:29,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:58:29,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:58:29,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:58:29,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:58:29,406 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:58:29,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:58:29,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:58:29,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:58:29,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:58:29,428 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:58:29,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:58:29,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:58:29,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:58:29,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:58:29,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:58:29,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:58:29,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:58:29,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:58:29,431 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:58:29,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:58:29,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:58:29,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:58:29,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:58:29,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:58:29,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:58:29,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:58:29,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:58:29,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:58:29,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:58:29,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:58:29,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:58:29,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:58:29,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:58:29,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:58:29,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:58:29,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:58:29,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:58:29,499 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:58:29,499 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:58:29,500 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 11:58:29,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59274c7a/b02d9feee6134d5d8938bdcc69e709c2/FLAGe22f00343 [2019-09-08 11:58:30,216 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:58:30,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 11:58:30,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59274c7a/b02d9feee6134d5d8938bdcc69e709c2/FLAGe22f00343 [2019-09-08 11:58:30,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e59274c7a/b02d9feee6134d5d8938bdcc69e709c2 [2019-09-08 11:58:30,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:58:30,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:58:30,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:58:30,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:58:30,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:58:30,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:58:30" (1/1) ... [2019-09-08 11:58:30,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315d73c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:30, skipping insertion in model container [2019-09-08 11:58:30,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:58:30" (1/1) ... [2019-09-08 11:58:30,420 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:58:30,562 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:58:31,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:58:31,368 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:58:31,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:58:31,967 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:58:31,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31 WrapperNode [2019-09-08 11:58:31,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:58:31,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:58:31,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:58:31,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:58:31,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31" (1/1) ... [2019-09-08 11:58:31,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31" (1/1) ... [2019-09-08 11:58:32,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31" (1/1) ... [2019-09-08 11:58:32,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31" (1/1) ... [2019-09-08 11:58:32,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31" (1/1) ... [2019-09-08 11:58:32,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31" (1/1) ... [2019-09-08 11:58:32,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31" (1/1) ... [2019-09-08 11:58:32,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:58:32,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:58:32,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:58:32,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:58:32,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31" (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:58:32,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:58:32,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:58:32,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:58:32,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:58:32,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:58:32,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:58:32,259 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:58:32,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:58:32,259 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:58:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:58:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:58:32,260 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:58:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:58:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:58:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:58:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:58:32,266 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:58:32,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:58:32,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:58:32,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:58:35,106 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:58:35,108 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:58:35,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:58:35 BoogieIcfgContainer [2019-09-08 11:58:35,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:58:35,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:58:35,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:58:35,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:58:35,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:58:30" (1/3) ... [2019-09-08 11:58:35,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617262c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:58:35, skipping insertion in model container [2019-09-08 11:58:35,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:58:31" (2/3) ... [2019-09-08 11:58:35,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617262c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:58:35, skipping insertion in model container [2019-09-08 11:58:35,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:58:35" (3/3) ... [2019-09-08 11:58:35,120 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 11:58:35,130 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:58:35,157 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-08 11:58:35,180 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-08 11:58:35,228 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:58:35,228 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:58:35,229 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:58:35,229 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:58:35,229 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:58:35,229 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:58:35,229 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:58:35,229 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:58:35,229 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:58:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states. [2019-09-08 11:58:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:58:35,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:35,296 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:58:35,299 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:35,305 INFO L82 PathProgramCache]: Analyzing trace with hash 446132065, now seen corresponding path program 1 times [2019-09-08 11:58:35,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:35,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:35,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:35,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:35,816 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:58:35,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:35,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:35,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:35,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:35,840 INFO L87 Difference]: Start difference. First operand 634 states. Second operand 5 states. [2019-09-08 11:58:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:36,848 INFO L93 Difference]: Finished difference Result 1198 states and 2048 transitions. [2019-09-08 11:58:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:36,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 11:58:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:36,877 INFO L225 Difference]: With dead ends: 1198 [2019-09-08 11:58:36,878 INFO L226 Difference]: Without dead ends: 719 [2019-09-08 11:58:36,890 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:58:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-08 11:58:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 659. [2019-09-08 11:58:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-08 11:58:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 873 transitions. [2019-09-08 11:58:36,998 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 873 transitions. Word has length 76 [2019-09-08 11:58:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:36,998 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 873 transitions. [2019-09-08 11:58:36,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 873 transitions. [2019-09-08 11:58:37,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:58:37,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:37,005 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:58:37,006 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:37,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:37,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1643184449, now seen corresponding path program 1 times [2019-09-08 11:58:37,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:37,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:37,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:37,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:37,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:37,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:37,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:37,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:37,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:37,303 INFO L87 Difference]: Start difference. First operand 659 states and 873 transitions. Second operand 5 states. [2019-09-08 11:58:37,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:37,762 INFO L93 Difference]: Finished difference Result 1151 states and 1564 transitions. [2019-09-08 11:58:37,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:37,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 11:58:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:37,767 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 11:58:37,767 INFO L226 Difference]: Without dead ends: 598 [2019-09-08 11:58:37,769 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:58:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-09-08 11:58:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-09-08 11:58:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-08 11:58:37,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 802 transitions. [2019-09-08 11:58:37,813 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 802 transitions. Word has length 77 [2019-09-08 11:58:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:37,814 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 802 transitions. [2019-09-08 11:58:37,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 802 transitions. [2019-09-08 11:58:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:58:37,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:37,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:58:37,817 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:37,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:37,817 INFO L82 PathProgramCache]: Analyzing trace with hash -98932957, now seen corresponding path program 1 times [2019-09-08 11:58:37,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:37,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:37,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:37,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:37,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:37,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:37,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:37,950 INFO L87 Difference]: Start difference. First operand 598 states and 802 transitions. Second operand 5 states. [2019-09-08 11:58:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:38,439 INFO L93 Difference]: Finished difference Result 1090 states and 1491 transitions. [2019-09-08 11:58:38,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:38,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-08 11:58:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:38,446 INFO L225 Difference]: With dead ends: 1090 [2019-09-08 11:58:38,446 INFO L226 Difference]: Without dead ends: 572 [2019-09-08 11:58:38,448 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:58:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-08 11:58:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-09-08 11:58:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-08 11:58:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 770 transitions. [2019-09-08 11:58:38,518 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 770 transitions. Word has length 78 [2019-09-08 11:58:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:38,519 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 770 transitions. [2019-09-08 11:58:38,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 770 transitions. [2019-09-08 11:58:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:58:38,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:38,521 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] [2019-09-08 11:58:38,522 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:38,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1520302037, now seen corresponding path program 1 times [2019-09-08 11:58:38,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:38,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:38,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:38,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:38,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:38,631 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:58:38,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:38,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:38,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:38,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:38,633 INFO L87 Difference]: Start difference. First operand 572 states and 770 transitions. Second operand 5 states. [2019-09-08 11:58:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:39,120 INFO L93 Difference]: Finished difference Result 1064 states and 1457 transitions. [2019-09-08 11:58:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:39,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-08 11:58:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:39,124 INFO L225 Difference]: With dead ends: 1064 [2019-09-08 11:58:39,124 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 11:58:39,126 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:58:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 11:58:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-08 11:58:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 11:58:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 756 transitions. [2019-09-08 11:58:39,153 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 756 transitions. Word has length 79 [2019-09-08 11:58:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:39,155 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 756 transitions. [2019-09-08 11:58:39,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 756 transitions. [2019-09-08 11:58:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:58:39,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:39,157 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] [2019-09-08 11:58:39,157 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:39,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:39,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1777858629, now seen corresponding path program 1 times [2019-09-08 11:58:39,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:39,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:39,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:39,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:39,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:39,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:58:39,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:58:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:58:39,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:58:39,309 INFO L87 Difference]: Start difference. First operand 562 states and 756 transitions. Second operand 5 states. [2019-09-08 11:58:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:39,750 INFO L93 Difference]: Finished difference Result 1054 states and 1441 transitions. [2019-09-08 11:58:39,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:58:39,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 11:58:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:39,754 INFO L225 Difference]: With dead ends: 1054 [2019-09-08 11:58:39,754 INFO L226 Difference]: Without dead ends: 551 [2019-09-08 11:58:39,755 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:58:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-09-08 11:58:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-09-08 11:58:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 742 transitions. [2019-09-08 11:58:39,794 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 742 transitions. Word has length 80 [2019-09-08 11:58:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:39,795 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 742 transitions. [2019-09-08 11:58:39,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:58:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 742 transitions. [2019-09-08 11:58:39,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:58:39,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:39,805 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] [2019-09-08 11:58:39,806 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1690487197, now seen corresponding path program 1 times [2019-09-08 11:58:39,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:39,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:39,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:39,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:40,261 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:58:40,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:40,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:40,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:40,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:40,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:40,263 INFO L87 Difference]: Start difference. First operand 551 states and 742 transitions. Second operand 9 states. [2019-09-08 11:58:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:41,902 INFO L93 Difference]: Finished difference Result 1293 states and 1802 transitions. [2019-09-08 11:58:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:58:41,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 11:58:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:41,909 INFO L225 Difference]: With dead ends: 1293 [2019-09-08 11:58:41,909 INFO L226 Difference]: Without dead ends: 1140 [2019-09-08 11:58:41,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:58:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-09-08 11:58:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 551. [2019-09-08 11:58:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 741 transitions. [2019-09-08 11:58:41,948 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 741 transitions. Word has length 81 [2019-09-08 11:58:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:41,949 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 741 transitions. [2019-09-08 11:58:41,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 741 transitions. [2019-09-08 11:58:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:58:41,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:41,951 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] [2019-09-08 11:58:41,951 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:41,952 INFO L82 PathProgramCache]: Analyzing trace with hash 533330474, now seen corresponding path program 1 times [2019-09-08 11:58:41,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:41,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:41,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:41,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:41,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:42,158 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:58:42,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:42,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:42,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:42,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:42,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:42,162 INFO L87 Difference]: Start difference. First operand 551 states and 741 transitions. Second operand 9 states. [2019-09-08 11:58:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:43,919 INFO L93 Difference]: Finished difference Result 1289 states and 1783 transitions. [2019-09-08 11:58:43,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:58:43,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-08 11:58:43,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:43,925 INFO L225 Difference]: With dead ends: 1289 [2019-09-08 11:58:43,925 INFO L226 Difference]: Without dead ends: 1097 [2019-09-08 11:58:43,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:58:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2019-09-08 11:58:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 551. [2019-09-08 11:58:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 740 transitions. [2019-09-08 11:58:43,963 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 740 transitions. Word has length 81 [2019-09-08 11:58:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:43,963 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 740 transitions. [2019-09-08 11:58:43,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 740 transitions. [2019-09-08 11:58:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:58:43,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:43,965 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] [2019-09-08 11:58:43,966 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:43,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:43,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1325711291, now seen corresponding path program 1 times [2019-09-08 11:58:43,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:43,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:43,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:43,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:43,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:44,122 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:58:44,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:44,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:58:44,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:58:44,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:58:44,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:58:44,124 INFO L87 Difference]: Start difference. First operand 551 states and 740 transitions. Second operand 8 states. [2019-09-08 11:58:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:45,287 INFO L93 Difference]: Finished difference Result 1058 states and 1403 transitions. [2019-09-08 11:58:45,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:58:45,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-09-08 11:58:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:45,292 INFO L225 Difference]: With dead ends: 1058 [2019-09-08 11:58:45,293 INFO L226 Difference]: Without dead ends: 782 [2019-09-08 11:58:45,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:58:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-09-08 11:58:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 551. [2019-09-08 11:58:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 739 transitions. [2019-09-08 11:58:45,336 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 739 transitions. Word has length 81 [2019-09-08 11:58:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:45,336 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 739 transitions. [2019-09-08 11:58:45,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:58:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 739 transitions. [2019-09-08 11:58:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:58:45,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:45,338 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] [2019-09-08 11:58:45,339 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1670879057, now seen corresponding path program 1 times [2019-09-08 11:58:45,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:45,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:45,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:45,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:45,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:45,559 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:58:45,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:45,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:45,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:45,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:45,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:45,561 INFO L87 Difference]: Start difference. First operand 551 states and 739 transitions. Second operand 9 states. [2019-09-08 11:58:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:47,250 INFO L93 Difference]: Finished difference Result 1252 states and 1736 transitions. [2019-09-08 11:58:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:58:47,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 11:58:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:47,259 INFO L225 Difference]: With dead ends: 1252 [2019-09-08 11:58:47,259 INFO L226 Difference]: Without dead ends: 1116 [2019-09-08 11:58:47,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:58:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-08 11:58:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-08 11:58:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 738 transitions. [2019-09-08 11:58:47,334 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 738 transitions. Word has length 83 [2019-09-08 11:58:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:47,335 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 738 transitions. [2019-09-08 11:58:47,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 738 transitions. [2019-09-08 11:58:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:58:47,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:47,338 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] [2019-09-08 11:58:47,339 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:47,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:47,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2064402550, now seen corresponding path program 1 times [2019-09-08 11:58:47,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:47,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:47,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:47,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:47,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:47,573 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:58:47,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:47,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:47,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:47,574 INFO L87 Difference]: Start difference. First operand 551 states and 738 transitions. Second operand 9 states. [2019-09-08 11:58:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:49,068 INFO L93 Difference]: Finished difference Result 1256 states and 1738 transitions. [2019-09-08 11:58:49,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:58:49,069 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 11:58:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:49,078 INFO L225 Difference]: With dead ends: 1256 [2019-09-08 11:58:49,078 INFO L226 Difference]: Without dead ends: 1116 [2019-09-08 11:58:49,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:58:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-08 11:58:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-08 11:58:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 737 transitions. [2019-09-08 11:58:49,121 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 737 transitions. Word has length 83 [2019-09-08 11:58:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:49,122 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 737 transitions. [2019-09-08 11:58:49,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 737 transitions. [2019-09-08 11:58:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:58:49,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:49,124 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] [2019-09-08 11:58:49,124 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1181772490, now seen corresponding path program 1 times [2019-09-08 11:58:49,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:49,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:58:49,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:49,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:49,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:49,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:49,308 INFO L87 Difference]: Start difference. First operand 551 states and 737 transitions. Second operand 9 states. [2019-09-08 11:58:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:51,102 INFO L93 Difference]: Finished difference Result 1256 states and 1737 transitions. [2019-09-08 11:58:51,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:58:51,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 11:58:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:51,109 INFO L225 Difference]: With dead ends: 1256 [2019-09-08 11:58:51,109 INFO L226 Difference]: Without dead ends: 1116 [2019-09-08 11:58:51,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:58:51,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-08 11:58:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-08 11:58:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 736 transitions. [2019-09-08 11:58:51,154 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 736 transitions. Word has length 83 [2019-09-08 11:58:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:51,154 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 736 transitions. [2019-09-08 11:58:51,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 736 transitions. [2019-09-08 11:58:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:58:51,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:51,156 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] [2019-09-08 11:58:51,157 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:51,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:51,157 INFO L82 PathProgramCache]: Analyzing trace with hash -876834767, now seen corresponding path program 1 times [2019-09-08 11:58:51,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:51,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:51,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:51,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:51,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:51,309 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:58:51,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:51,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:51,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:51,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:51,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:51,312 INFO L87 Difference]: Start difference. First operand 551 states and 736 transitions. Second operand 9 states. [2019-09-08 11:58:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:53,135 INFO L93 Difference]: Finished difference Result 1302 states and 1804 transitions. [2019-09-08 11:58:53,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:58:53,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 11:58:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:53,143 INFO L225 Difference]: With dead ends: 1302 [2019-09-08 11:58:53,143 INFO L226 Difference]: Without dead ends: 1140 [2019-09-08 11:58:53,145 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:58:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-09-08 11:58:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 551. [2019-09-08 11:58:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 735 transitions. [2019-09-08 11:58:53,212 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 735 transitions. Word has length 83 [2019-09-08 11:58:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:53,213 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 735 transitions. [2019-09-08 11:58:53,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 735 transitions. [2019-09-08 11:58:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:58:53,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:53,215 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] [2019-09-08 11:58:53,215 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:53,216 INFO L82 PathProgramCache]: Analyzing trace with hash 287644134, now seen corresponding path program 1 times [2019-09-08 11:58:53,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:53,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:53,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:53,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:53,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:53,401 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:58:53,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:53,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:53,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:53,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:53,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:53,402 INFO L87 Difference]: Start difference. First operand 551 states and 735 transitions. Second operand 9 states. [2019-09-08 11:58:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:55,125 INFO L93 Difference]: Finished difference Result 1262 states and 1743 transitions. [2019-09-08 11:58:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:58:55,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 11:58:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:55,132 INFO L225 Difference]: With dead ends: 1262 [2019-09-08 11:58:55,133 INFO L226 Difference]: Without dead ends: 1116 [2019-09-08 11:58:55,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:58:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-08 11:58:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-08 11:58:55,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 733 transitions. [2019-09-08 11:58:55,183 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 733 transitions. Word has length 83 [2019-09-08 11:58:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:55,183 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 733 transitions. [2019-09-08 11:58:55,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 733 transitions. [2019-09-08 11:58:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:58:55,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:55,185 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] [2019-09-08 11:58:55,185 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1062374831, now seen corresponding path program 1 times [2019-09-08 11:58:55,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:55,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:55,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:55,433 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:58:55,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:55,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:55,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:55,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:55,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:55,440 INFO L87 Difference]: Start difference. First operand 551 states and 733 transitions. Second operand 9 states. [2019-09-08 11:58:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:57,165 INFO L93 Difference]: Finished difference Result 1312 states and 1814 transitions. [2019-09-08 11:58:57,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:58:57,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 11:58:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:57,172 INFO L225 Difference]: With dead ends: 1312 [2019-09-08 11:58:57,173 INFO L226 Difference]: Without dead ends: 1140 [2019-09-08 11:58:57,174 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:58:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-09-08 11:58:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 551. [2019-09-08 11:58:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 731 transitions. [2019-09-08 11:58:57,222 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 731 transitions. Word has length 83 [2019-09-08 11:58:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:57,222 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 731 transitions. [2019-09-08 11:58:57,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 731 transitions. [2019-09-08 11:58:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:58:57,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:57,224 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] [2019-09-08 11:58:57,225 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:57,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:57,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1850218341, now seen corresponding path program 1 times [2019-09-08 11:58:57,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:57,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:57,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:57,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:57,389 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:58:57,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:57,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:57,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:57,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:57,390 INFO L87 Difference]: Start difference. First operand 551 states and 731 transitions. Second operand 9 states. [2019-09-08 11:58:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:58:58,749 INFO L93 Difference]: Finished difference Result 1141 states and 1579 transitions. [2019-09-08 11:58:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:58:58,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2019-09-08 11:58:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:58:58,754 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 11:58:58,754 INFO L226 Difference]: Without dead ends: 883 [2019-09-08 11:58:58,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:58:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-09-08 11:58:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 551. [2019-09-08 11:58:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:58:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 729 transitions. [2019-09-08 11:58:58,803 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 729 transitions. Word has length 83 [2019-09-08 11:58:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:58:58,803 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 729 transitions. [2019-09-08 11:58:58,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:58:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 729 transitions. [2019-09-08 11:58:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:58:58,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:58:58,805 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] [2019-09-08 11:58:58,806 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:58:58,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:58:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1299527057, now seen corresponding path program 1 times [2019-09-08 11:58:58,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:58:58,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:58:58,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:58,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:58:58,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:58:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:58:58,979 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:58:58,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:58:58,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:58:58,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:58:58,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:58:58,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:58:58,983 INFO L87 Difference]: Start difference. First operand 551 states and 729 transitions. Second operand 9 states. [2019-09-08 11:59:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:00,819 INFO L93 Difference]: Finished difference Result 1222 states and 1675 transitions. [2019-09-08 11:59:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:00,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:00,826 INFO L225 Difference]: With dead ends: 1222 [2019-09-08 11:59:00,826 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:00,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:00,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 728 transitions. [2019-09-08 11:59:00,879 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 728 transitions. Word has length 85 [2019-09-08 11:59:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:00,879 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 728 transitions. [2019-09-08 11:59:00,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 728 transitions. [2019-09-08 11:59:00,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:00,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:00,881 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] [2019-09-08 11:59:00,882 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:00,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:00,882 INFO L82 PathProgramCache]: Analyzing trace with hash -716975399, now seen corresponding path program 1 times [2019-09-08 11:59:00,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:00,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:00,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:00,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:00,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:59:01,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:01,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:01,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:01,045 INFO L87 Difference]: Start difference. First operand 551 states and 728 transitions. Second operand 9 states. [2019-09-08 11:59:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:02,770 INFO L93 Difference]: Finished difference Result 1220 states and 1671 transitions. [2019-09-08 11:59:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:02,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:02,775 INFO L225 Difference]: With dead ends: 1220 [2019-09-08 11:59:02,775 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:02,776 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:59:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 727 transitions. [2019-09-08 11:59:02,828 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 727 transitions. Word has length 85 [2019-09-08 11:59:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:02,829 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 727 transitions. [2019-09-08 11:59:02,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 727 transitions. [2019-09-08 11:59:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:02,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:02,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:59:02,831 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:02,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:02,831 INFO L82 PathProgramCache]: Analyzing trace with hash 777191179, now seen corresponding path program 1 times [2019-09-08 11:59:02,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:02,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:02,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:02,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:02,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:02,983 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:59:02,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:02,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:02,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:02,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:02,985 INFO L87 Difference]: Start difference. First operand 551 states and 727 transitions. Second operand 9 states. [2019-09-08 11:59:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:04,701 INFO L93 Difference]: Finished difference Result 1222 states and 1672 transitions. [2019-09-08 11:59:04,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:04,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:04,706 INFO L225 Difference]: With dead ends: 1222 [2019-09-08 11:59:04,706 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:04,706 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:59:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 726 transitions. [2019-09-08 11:59:04,760 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 726 transitions. Word has length 85 [2019-09-08 11:59:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:04,761 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 726 transitions. [2019-09-08 11:59:04,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 726 transitions. [2019-09-08 11:59:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:04,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:04,762 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] [2019-09-08 11:59:04,763 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:04,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:04,763 INFO L82 PathProgramCache]: Analyzing trace with hash -496308349, now seen corresponding path program 1 times [2019-09-08 11:59:04,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:04,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:04,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:04,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:04,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:04,915 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:59:04,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:04,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:04,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:04,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:04,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:04,917 INFO L87 Difference]: Start difference. First operand 551 states and 726 transitions. Second operand 9 states. [2019-09-08 11:59:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:06,740 INFO L93 Difference]: Finished difference Result 1097 states and 1483 transitions. [2019-09-08 11:59:06,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:06,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:06,744 INFO L225 Difference]: With dead ends: 1097 [2019-09-08 11:59:06,744 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:06,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 725 transitions. [2019-09-08 11:59:06,797 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 725 transitions. Word has length 85 [2019-09-08 11:59:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:06,798 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 725 transitions. [2019-09-08 11:59:06,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 725 transitions. [2019-09-08 11:59:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:06,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:06,800 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] [2019-09-08 11:59:06,800 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:06,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:06,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2124094268, now seen corresponding path program 1 times [2019-09-08 11:59:06,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:06,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:06,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:06,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:06,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:06,962 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:59:06,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:06,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:06,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:06,964 INFO L87 Difference]: Start difference. First operand 551 states and 725 transitions. Second operand 9 states. [2019-09-08 11:59:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:08,652 INFO L93 Difference]: Finished difference Result 1225 states and 1672 transitions. [2019-09-08 11:59:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:08,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:08,657 INFO L225 Difference]: With dead ends: 1225 [2019-09-08 11:59:08,657 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:08,658 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:59:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 724 transitions. [2019-09-08 11:59:08,698 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 724 transitions. Word has length 85 [2019-09-08 11:59:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:08,698 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 724 transitions. [2019-09-08 11:59:08,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 724 transitions. [2019-09-08 11:59:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:08,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:08,701 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] [2019-09-08 11:59:08,701 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:08,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash -194937756, now seen corresponding path program 1 times [2019-09-08 11:59:08,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:08,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:08,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:59:08,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:08,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:08,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:08,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:08,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:08,858 INFO L87 Difference]: Start difference. First operand 551 states and 724 transitions. Second operand 9 states. [2019-09-08 11:59:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:10,539 INFO L93 Difference]: Finished difference Result 1261 states and 1725 transitions. [2019-09-08 11:59:10,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:10,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:10,544 INFO L225 Difference]: With dead ends: 1261 [2019-09-08 11:59:10,544 INFO L226 Difference]: Without dead ends: 1116 [2019-09-08 11:59:10,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-08 11:59:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-08 11:59:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 723 transitions. [2019-09-08 11:59:10,603 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 723 transitions. Word has length 85 [2019-09-08 11:59:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:10,604 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 723 transitions. [2019-09-08 11:59:10,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 723 transitions. [2019-09-08 11:59:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:10,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:10,606 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] [2019-09-08 11:59:10,606 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:10,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1160181619, now seen corresponding path program 1 times [2019-09-08 11:59:10,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:10,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:10,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:10,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:10,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:10,760 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:59:10,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:10,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:10,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:10,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:10,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:10,762 INFO L87 Difference]: Start difference. First operand 551 states and 723 transitions. Second operand 9 states. [2019-09-08 11:59:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:12,370 INFO L93 Difference]: Finished difference Result 1222 states and 1667 transitions. [2019-09-08 11:59:12,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:12,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:12,376 INFO L225 Difference]: With dead ends: 1222 [2019-09-08 11:59:12,376 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:12,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 722 transitions. [2019-09-08 11:59:12,466 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 722 transitions. Word has length 85 [2019-09-08 11:59:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:12,467 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 722 transitions. [2019-09-08 11:59:12,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 722 transitions. [2019-09-08 11:59:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:12,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:12,472 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] [2019-09-08 11:59:12,473 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:12,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1009658424, now seen corresponding path program 1 times [2019-09-08 11:59:12,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:12,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:12,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:12,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:12,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:12,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:59:12,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:12,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:12,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:12,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:12,669 INFO L87 Difference]: Start difference. First operand 551 states and 722 transitions. Second operand 9 states. [2019-09-08 11:59:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:14,462 INFO L93 Difference]: Finished difference Result 1225 states and 1669 transitions. [2019-09-08 11:59:14,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:14,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:14,467 INFO L225 Difference]: With dead ends: 1225 [2019-09-08 11:59:14,467 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:14,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 721 transitions. [2019-09-08 11:59:14,510 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 721 transitions. Word has length 85 [2019-09-08 11:59:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:14,510 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 721 transitions. [2019-09-08 11:59:14,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 721 transitions. [2019-09-08 11:59:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:14,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:14,512 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] [2019-09-08 11:59:14,512 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash -527052732, now seen corresponding path program 1 times [2019-09-08 11:59:14,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:14,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:14,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:14,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:14,654 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:59:14,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:14,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:14,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:14,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:14,658 INFO L87 Difference]: Start difference. First operand 551 states and 721 transitions. Second operand 9 states. [2019-09-08 11:59:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:16,378 INFO L93 Difference]: Finished difference Result 1228 states and 1671 transitions. [2019-09-08 11:59:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:16,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:16,383 INFO L225 Difference]: With dead ends: 1228 [2019-09-08 11:59:16,383 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:16,384 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:59:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 719 transitions. [2019-09-08 11:59:16,446 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 719 transitions. Word has length 85 [2019-09-08 11:59:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:16,447 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 719 transitions. [2019-09-08 11:59:16,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 719 transitions. [2019-09-08 11:59:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:16,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:16,449 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] [2019-09-08 11:59:16,449 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1402103780, now seen corresponding path program 1 times [2019-09-08 11:59:16,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:16,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:16,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:16,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:16,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:16,596 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:59:16,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:16,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:16,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:16,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:16,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:16,598 INFO L87 Difference]: Start difference. First operand 551 states and 719 transitions. Second operand 9 states. [2019-09-08 11:59:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:18,078 INFO L93 Difference]: Finished difference Result 1268 states and 1730 transitions. [2019-09-08 11:59:18,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:18,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:18,083 INFO L225 Difference]: With dead ends: 1268 [2019-09-08 11:59:18,083 INFO L226 Difference]: Without dead ends: 1116 [2019-09-08 11:59:18,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-08 11:59:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-08 11:59:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 717 transitions. [2019-09-08 11:59:18,127 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 717 transitions. Word has length 85 [2019-09-08 11:59:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:18,127 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 717 transitions. [2019-09-08 11:59:18,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 717 transitions. [2019-09-08 11:59:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:18,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:18,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:59:18,129 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1985070686, now seen corresponding path program 1 times [2019-09-08 11:59:18,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:18,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:18,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:18,281 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:59:18,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:18,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:18,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:18,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:18,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:18,283 INFO L87 Difference]: Start difference. First operand 551 states and 717 transitions. Second operand 9 states. [2019-09-08 11:59:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:19,855 INFO L93 Difference]: Finished difference Result 1332 states and 1815 transitions. [2019-09-08 11:59:19,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:19,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:19,860 INFO L225 Difference]: With dead ends: 1332 [2019-09-08 11:59:19,860 INFO L226 Difference]: Without dead ends: 1140 [2019-09-08 11:59:19,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-09-08 11:59:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 551. [2019-09-08 11:59:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 715 transitions. [2019-09-08 11:59:19,911 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 715 transitions. Word has length 85 [2019-09-08 11:59:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:19,911 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 715 transitions. [2019-09-08 11:59:19,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 715 transitions. [2019-09-08 11:59:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:19,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:19,913 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] [2019-09-08 11:59:19,914 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:19,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1621426561, now seen corresponding path program 1 times [2019-09-08 11:59:19,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:19,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:19,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:19,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:19,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:20,050 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:59:20,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:20,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:20,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:20,052 INFO L87 Difference]: Start difference. First operand 551 states and 715 transitions. Second operand 9 states. [2019-09-08 11:59:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:21,732 INFO L93 Difference]: Finished difference Result 1097 states and 1470 transitions. [2019-09-08 11:59:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:21,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:21,736 INFO L225 Difference]: With dead ends: 1097 [2019-09-08 11:59:21,736 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:21,737 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:59:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 713 transitions. [2019-09-08 11:59:21,798 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 713 transitions. Word has length 85 [2019-09-08 11:59:21,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:21,798 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 713 transitions. [2019-09-08 11:59:21,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 713 transitions. [2019-09-08 11:59:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:21,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:21,800 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] [2019-09-08 11:59:21,800 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:21,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:21,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1236378400, now seen corresponding path program 1 times [2019-09-08 11:59:21,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:21,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:21,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:21,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:21,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:21,950 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:59:21,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:21,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:21,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:21,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:21,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:21,951 INFO L87 Difference]: Start difference. First operand 551 states and 713 transitions. Second operand 9 states. [2019-09-08 11:59:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:23,786 INFO L93 Difference]: Finished difference Result 1133 states and 1520 transitions. [2019-09-08 11:59:23,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:23,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:23,789 INFO L225 Difference]: With dead ends: 1133 [2019-09-08 11:59:23,789 INFO L226 Difference]: Without dead ends: 1116 [2019-09-08 11:59:23,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-09-08 11:59:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 551. [2019-09-08 11:59:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 711 transitions. [2019-09-08 11:59:23,857 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 711 transitions. Word has length 85 [2019-09-08 11:59:23,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:23,858 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 711 transitions. [2019-09-08 11:59:23,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 711 transitions. [2019-09-08 11:59:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:23,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:23,860 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] [2019-09-08 11:59:23,861 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:23,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:23,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1585291813, now seen corresponding path program 1 times [2019-09-08 11:59:23,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:23,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:23,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:23,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:23,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:24,009 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:59:24,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:24,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:24,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:24,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:24,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:24,010 INFO L87 Difference]: Start difference. First operand 551 states and 711 transitions. Second operand 9 states. [2019-09-08 11:59:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:25,598 INFO L93 Difference]: Finished difference Result 1224 states and 1656 transitions. [2019-09-08 11:59:25,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:25,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:25,600 INFO L225 Difference]: With dead ends: 1224 [2019-09-08 11:59:25,601 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:25,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 709 transitions. [2019-09-08 11:59:25,676 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 709 transitions. Word has length 85 [2019-09-08 11:59:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:25,676 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 709 transitions. [2019-09-08 11:59:25,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 709 transitions. [2019-09-08 11:59:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:59:25,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:25,678 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] [2019-09-08 11:59:25,678 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1435826419, now seen corresponding path program 1 times [2019-09-08 11:59:25,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:25,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:25,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:25,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:25,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:25,816 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:59:25,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:25,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:59:25,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:59:25,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:59:25,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:59:25,818 INFO L87 Difference]: Start difference. First operand 551 states and 709 transitions. Second operand 9 states. [2019-09-08 11:59:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:27,704 INFO L93 Difference]: Finished difference Result 1097 states and 1464 transitions. [2019-09-08 11:59:27,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:59:27,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:59:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:27,707 INFO L225 Difference]: With dead ends: 1097 [2019-09-08 11:59:27,707 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 11:59:27,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:59:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 11:59:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 551. [2019-09-08 11:59:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 11:59:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 707 transitions. [2019-09-08 11:59:27,761 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 707 transitions. Word has length 85 [2019-09-08 11:59:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:27,761 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 707 transitions. [2019-09-08 11:59:27,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:59:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 707 transitions. [2019-09-08 11:59:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:59:27,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:27,763 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] [2019-09-08 11:59:27,764 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1981907169, now seen corresponding path program 1 times [2019-09-08 11:59:27,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:27,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:27,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:27,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:27,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:29,298 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:59:29,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:29,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 11:59:29,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 11:59:29,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 11:59:29,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:59:29,300 INFO L87 Difference]: Start difference. First operand 551 states and 707 transitions. Second operand 22 states. [2019-09-08 11:59:30,494 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-08 11:59:30,816 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-08 11:59:31,274 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-08 11:59:31,449 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 11:59:31,684 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 11:59:31,894 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 11:59:32,096 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 11:59:32,334 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 11:59:32,752 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 11:59:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:35,926 INFO L93 Difference]: Finished difference Result 1236 states and 1646 transitions. [2019-09-08 11:59:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:59:35,927 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-09-08 11:59:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:35,929 INFO L225 Difference]: With dead ends: 1236 [2019-09-08 11:59:35,929 INFO L226 Difference]: Without dead ends: 1105 [2019-09-08 11:59:35,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 11:59:35,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-09-08 11:59:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 557. [2019-09-08 11:59:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-08 11:59:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 713 transitions. [2019-09-08 11:59:35,989 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 713 transitions. Word has length 87 [2019-09-08 11:59:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:35,989 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 713 transitions. [2019-09-08 11:59:35,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 11:59:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 713 transitions. [2019-09-08 11:59:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:59:35,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:35,991 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] [2019-09-08 11:59:35,992 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:35,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:35,992 INFO L82 PathProgramCache]: Analyzing trace with hash 500673725, now seen corresponding path program 1 times [2019-09-08 11:59:35,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:35,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:35,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:35,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:35,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:36,850 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:59:36,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:36,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:59:36,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:59:36,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:59:36,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:59:36,852 INFO L87 Difference]: Start difference. First operand 557 states and 713 transitions. Second operand 17 states. [2019-09-08 11:59:37,491 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 11:59:37,651 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 11:59:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:39,097 INFO L93 Difference]: Finished difference Result 1034 states and 1393 transitions. [2019-09-08 11:59:39,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:59:39,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 11:59:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:39,099 INFO L225 Difference]: With dead ends: 1034 [2019-09-08 11:59:39,099 INFO L226 Difference]: Without dead ends: 855 [2019-09-08 11:59:39,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:59:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-09-08 11:59:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 532. [2019-09-08 11:59:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-09-08 11:59:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 680 transitions. [2019-09-08 11:59:39,165 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 680 transitions. Word has length 87 [2019-09-08 11:59:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:39,165 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 680 transitions. [2019-09-08 11:59:39,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:59:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 680 transitions. [2019-09-08 11:59:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:59:39,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:39,167 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] [2019-09-08 11:59:39,167 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash -2120669208, now seen corresponding path program 1 times [2019-09-08 11:59:39,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:39,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:39,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:39,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:39,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:59:40,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:40,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:59:40,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:59:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:59:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:59:40,085 INFO L87 Difference]: Start difference. First operand 532 states and 680 transitions. Second operand 17 states. [2019-09-08 11:59:40,794 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 11:59:40,979 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 11:59:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:43,873 INFO L93 Difference]: Finished difference Result 1271 states and 1710 transitions. [2019-09-08 11:59:43,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:59:43,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 11:59:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:43,879 INFO L225 Difference]: With dead ends: 1271 [2019-09-08 11:59:43,880 INFO L226 Difference]: Without dead ends: 1136 [2019-09-08 11:59:43,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:59:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-08 11:59:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 531. [2019-09-08 11:59:44,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-08 11:59:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 677 transitions. [2019-09-08 11:59:44,005 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 677 transitions. Word has length 87 [2019-09-08 11:59:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:44,005 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 677 transitions. [2019-09-08 11:59:44,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:59:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 677 transitions. [2019-09-08 11:59:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:59:44,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:44,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:59:44,007 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:44,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:44,008 INFO L82 PathProgramCache]: Analyzing trace with hash 607545151, now seen corresponding path program 1 times [2019-09-08 11:59:44,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:44,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:44,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:44,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:44,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:44,869 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 11:59:45,005 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 11:59:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:59:45,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:45,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 11:59:45,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 11:59:45,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 11:59:45,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:59:45,792 INFO L87 Difference]: Start difference. First operand 531 states and 677 transitions. Second operand 25 states. [2019-09-08 11:59:45,957 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 11:59:46,962 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-08 11:59:47,299 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-08 11:59:47,623 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2019-09-08 11:59:48,010 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-09-08 11:59:48,262 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 11:59:48,502 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 11:59:48,719 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 11:59:48,991 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 11:59:49,202 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 11:59:49,485 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 11:59:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:53,123 INFO L93 Difference]: Finished difference Result 980 states and 1297 transitions. [2019-09-08 11:59:53,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:59:53,124 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2019-09-08 11:59:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:53,126 INFO L225 Difference]: With dead ends: 980 [2019-09-08 11:59:53,126 INFO L226 Difference]: Without dead ends: 824 [2019-09-08 11:59:53,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 11:59:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-09-08 11:59:53,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 542. [2019-09-08 11:59:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-08 11:59:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 689 transitions. [2019-09-08 11:59:53,254 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 689 transitions. Word has length 87 [2019-09-08 11:59:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:53,254 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 689 transitions. [2019-09-08 11:59:53,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 11:59:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 689 transitions. [2019-09-08 11:59:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:59:53,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:53,256 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] [2019-09-08 11:59:53,256 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:53,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:53,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1697656993, now seen corresponding path program 1 times [2019-09-08 11:59:53,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:53,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:53,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:53,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:53,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:53,911 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:59:53,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:53,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:59:53,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:59:53,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:59:53,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:59:53,913 INFO L87 Difference]: Start difference. First operand 542 states and 689 transitions. Second operand 15 states. [2019-09-08 11:59:54,485 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-08 11:59:54,613 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 11:59:54,745 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 11:59:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:55,892 INFO L93 Difference]: Finished difference Result 939 states and 1250 transitions. [2019-09-08 11:59:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:59:55,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-09-08 11:59:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:55,894 INFO L225 Difference]: With dead ends: 939 [2019-09-08 11:59:55,895 INFO L226 Difference]: Without dead ends: 711 [2019-09-08 11:59:55,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 11:59:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-08 11:59:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 501. [2019-09-08 11:59:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-08 11:59:56,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 640 transitions. [2019-09-08 11:59:56,008 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 640 transitions. Word has length 87 [2019-09-08 11:59:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:59:56,008 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 640 transitions. [2019-09-08 11:59:56,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:59:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 640 transitions. [2019-09-08 11:59:56,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:59:56,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:59:56,010 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] [2019-09-08 11:59:56,010 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:59:56,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:59:56,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2061124639, now seen corresponding path program 1 times [2019-09-08 11:59:56,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:59:56,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:59:56,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:56,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:59:56,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:59:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:59:56,870 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:59:56,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:59:56,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:59:56,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:59:56,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:59:56,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:59:56,872 INFO L87 Difference]: Start difference. First operand 501 states and 640 transitions. Second operand 17 states. [2019-09-08 11:59:57,595 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 11:59:57,740 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 11:59:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:59:59,991 INFO L93 Difference]: Finished difference Result 1237 states and 1673 transitions. [2019-09-08 11:59:59,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:59:59,991 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 11:59:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:59:59,994 INFO L225 Difference]: With dead ends: 1237 [2019-09-08 11:59:59,994 INFO L226 Difference]: Without dead ends: 1063 [2019-09-08 11:59:59,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:59:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2019-09-08 12:00:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 481. [2019-09-08 12:00:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-08 12:00:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 611 transitions. [2019-09-08 12:00:00,123 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 611 transitions. Word has length 87 [2019-09-08 12:00:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:00,123 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 611 transitions. [2019-09-08 12:00:00,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:00:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 611 transitions. [2019-09-08 12:00:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:00:00,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:00,125 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] [2019-09-08 12:00:00,126 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:00,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash 555238255, now seen corresponding path program 1 times [2019-09-08 12:00:00,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:00,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:00,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:00,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:00,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:00,974 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 12:00:02,354 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 12:00:02,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:02,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:00:02,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:00:02,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:00:02,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:00:02,356 INFO L87 Difference]: Start difference. First operand 481 states and 611 transitions. Second operand 26 states. [2019-09-08 12:00:02,547 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-08 12:00:03,224 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:00:03,373 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-08 12:00:03,706 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 12:00:03,968 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-08 12:00:04,297 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-08 12:00:04,753 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 88 [2019-09-08 12:00:05,009 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 12:00:05,267 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-08 12:00:05,572 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-08 12:00:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:08,573 INFO L93 Difference]: Finished difference Result 763 states and 998 transitions. [2019-09-08 12:00:08,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:00:08,573 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2019-09-08 12:00:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:08,575 INFO L225 Difference]: With dead ends: 763 [2019-09-08 12:00:08,576 INFO L226 Difference]: Without dead ends: 631 [2019-09-08 12:00:08,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=331, Invalid=1309, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:00:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-08 12:00:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 496. [2019-09-08 12:00:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-08 12:00:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 632 transitions. [2019-09-08 12:00:08,713 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 632 transitions. Word has length 87 [2019-09-08 12:00:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:08,713 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 632 transitions. [2019-09-08 12:00:08,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:00:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 632 transitions. [2019-09-08 12:00:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:00:08,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:08,715 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] [2019-09-08 12:00:08,715 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1881074051, now seen corresponding path program 1 times [2019-09-08 12:00:08,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:08,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:08,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:08,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:08,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:09,532 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 12:00:09,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:09,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:00:09,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:00:09,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:00:09,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:00:09,533 INFO L87 Difference]: Start difference. First operand 496 states and 632 transitions. Second operand 16 states. [2019-09-08 12:00:10,235 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 12:00:10,381 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-08 12:00:10,534 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-09-08 12:00:10,674 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-08 12:00:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:12,312 INFO L93 Difference]: Finished difference Result 802 states and 1011 transitions. [2019-09-08 12:00:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:00:12,313 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-09-08 12:00:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:12,314 INFO L225 Difference]: With dead ends: 802 [2019-09-08 12:00:12,314 INFO L226 Difference]: Without dead ends: 798 [2019-09-08 12:00:12,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:00:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-09-08 12:00:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 502. [2019-09-08 12:00:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-08 12:00:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 640 transitions. [2019-09-08 12:00:12,406 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 640 transitions. Word has length 87 [2019-09-08 12:00:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:12,406 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 640 transitions. [2019-09-08 12:00:12,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:00:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 640 transitions. [2019-09-08 12:00:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 12:00:12,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:12,407 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] [2019-09-08 12:00:12,408 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash -525959545, now seen corresponding path program 1 times [2019-09-08 12:00:12,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:12,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:12,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:13,279 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 12:00:13,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:13,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:00:13,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:00:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:00:13,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:00:13,281 INFO L87 Difference]: Start difference. First operand 502 states and 640 transitions. Second operand 17 states. [2019-09-08 12:00:13,947 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:00:14,119 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 12:00:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:15,056 INFO L93 Difference]: Finished difference Result 878 states and 1180 transitions. [2019-09-08 12:00:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:00:15,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-08 12:00:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:15,057 INFO L225 Difference]: With dead ends: 878 [2019-09-08 12:00:15,057 INFO L226 Difference]: Without dead ends: 656 [2019-09-08 12:00:15,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:00:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-09-08 12:00:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 460. [2019-09-08 12:00:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 12:00:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 583 transitions. [2019-09-08 12:00:15,136 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 583 transitions. Word has length 87 [2019-09-08 12:00:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:15,137 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 583 transitions. [2019-09-08 12:00:15,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:00:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 583 transitions. [2019-09-08 12:00:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:00:15,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:15,138 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:15,138 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash -285902363, now seen corresponding path program 1 times [2019-09-08 12:00:15,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:15,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:15,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:15,634 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 12:00:15,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:15,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:00:15,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:00:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:00:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:00:15,635 INFO L87 Difference]: Start difference. First operand 460 states and 583 transitions. Second operand 13 states. [2019-09-08 12:00:16,327 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-08 12:00:16,483 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-09-08 12:00:16,833 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-09-08 12:00:17,173 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-09-08 12:00:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:18,596 INFO L93 Difference]: Finished difference Result 2271 states and 3182 transitions. [2019-09-08 12:00:18,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:00:18,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-08 12:00:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:18,600 INFO L225 Difference]: With dead ends: 2271 [2019-09-08 12:00:18,600 INFO L226 Difference]: Without dead ends: 2117 [2019-09-08 12:00:18,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:00:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2019-09-08 12:00:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 423. [2019-09-08 12:00:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-09-08 12:00:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 532 transitions. [2019-09-08 12:00:18,684 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 532 transitions. Word has length 88 [2019-09-08 12:00:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:18,685 INFO L475 AbstractCegarLoop]: Abstraction has 423 states and 532 transitions. [2019-09-08 12:00:18,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:00:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 532 transitions. [2019-09-08 12:00:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:00:18,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:18,686 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:18,686 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1241895498, now seen corresponding path program 1 times [2019-09-08 12:00:18,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:18,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:18,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:19,166 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 12:00:19,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:19,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:00:19,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:00:19,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:00:19,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:00:19,168 INFO L87 Difference]: Start difference. First operand 423 states and 532 transitions. Second operand 12 states. [2019-09-08 12:00:19,619 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-09-08 12:00:19,747 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-09-08 12:00:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:20,639 INFO L93 Difference]: Finished difference Result 778 states and 1021 transitions. [2019-09-08 12:00:20,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:00:20,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-08 12:00:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:20,640 INFO L225 Difference]: With dead ends: 778 [2019-09-08 12:00:20,640 INFO L226 Difference]: Without dead ends: 646 [2019-09-08 12:00:20,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:00:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-08 12:00:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 419. [2019-09-08 12:00:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-09-08 12:00:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 527 transitions. [2019-09-08 12:00:20,724 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 527 transitions. Word has length 88 [2019-09-08 12:00:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:20,724 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 527 transitions. [2019-09-08 12:00:20,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:00:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 527 transitions. [2019-09-08 12:00:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:00:20,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:20,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:20,726 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash 747869654, now seen corresponding path program 1 times [2019-09-08 12:00:20,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:20,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:20,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:20,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:21,338 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 12:00:21,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:21,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:00:21,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:00:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:00:21,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:00:21,339 INFO L87 Difference]: Start difference. First operand 419 states and 527 transitions. Second operand 13 states. [2019-09-08 12:00:21,907 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-08 12:00:22,067 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-08 12:00:22,279 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-09-08 12:00:22,464 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-09-08 12:00:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:23,806 INFO L93 Difference]: Finished difference Result 1907 states and 2675 transitions. [2019-09-08 12:00:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:00:23,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-08 12:00:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:23,808 INFO L225 Difference]: With dead ends: 1907 [2019-09-08 12:00:23,809 INFO L226 Difference]: Without dead ends: 1755 [2019-09-08 12:00:23,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:00:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-09-08 12:00:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 395. [2019-09-08 12:00:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-08 12:00:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 496 transitions. [2019-09-08 12:00:23,926 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 496 transitions. Word has length 88 [2019-09-08 12:00:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:23,927 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 496 transitions. [2019-09-08 12:00:23,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:00:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 496 transitions. [2019-09-08 12:00:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:00:23,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:23,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:23,928 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:23,928 INFO L82 PathProgramCache]: Analyzing trace with hash -493449678, now seen corresponding path program 1 times [2019-09-08 12:00:23,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:23,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:23,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:23,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:23,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:24,370 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 12:00:24,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:24,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:00:24,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:00:24,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:00:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:00:24,372 INFO L87 Difference]: Start difference. First operand 395 states and 496 transitions. Second operand 12 states. [2019-09-08 12:00:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:26,400 INFO L93 Difference]: Finished difference Result 1593 states and 2224 transitions. [2019-09-08 12:00:26,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:00:26,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-08 12:00:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:26,402 INFO L225 Difference]: With dead ends: 1593 [2019-09-08 12:00:26,403 INFO L226 Difference]: Without dead ends: 1431 [2019-09-08 12:00:26,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:00:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-09-08 12:00:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 361. [2019-09-08 12:00:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-08 12:00:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 454 transitions. [2019-09-08 12:00:26,511 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 454 transitions. Word has length 88 [2019-09-08 12:00:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:26,511 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 454 transitions. [2019-09-08 12:00:26,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:00:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 454 transitions. [2019-09-08 12:00:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:00:26,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:26,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:26,512 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash 479313184, now seen corresponding path program 1 times [2019-09-08 12:00:26,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:26,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:26,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:26,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:26,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:26,652 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 12:00:26,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:26,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:00:26,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:00:26,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:00:26,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:00:26,653 INFO L87 Difference]: Start difference. First operand 361 states and 454 transitions. Second operand 9 states. [2019-09-08 12:00:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:28,143 INFO L93 Difference]: Finished difference Result 985 states and 1343 transitions. [2019-09-08 12:00:28,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:00:28,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 12:00:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:28,144 INFO L225 Difference]: With dead ends: 985 [2019-09-08 12:00:28,144 INFO L226 Difference]: Without dead ends: 827 [2019-09-08 12:00:28,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:00:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-09-08 12:00:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 361. [2019-09-08 12:00:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-08 12:00:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 452 transitions. [2019-09-08 12:00:28,308 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 452 transitions. Word has length 88 [2019-09-08 12:00:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:28,308 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 452 transitions. [2019-09-08 12:00:28,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:00:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 452 transitions. [2019-09-08 12:00:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 12:00:28,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:28,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:28,310 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash -134912059, now seen corresponding path program 1 times [2019-09-08 12:00:28,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:28,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:28,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:28,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:28,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 12:00:28,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:28,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:00:28,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:00:28,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:00:28,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:00:28,803 INFO L87 Difference]: Start difference. First operand 361 states and 452 transitions. Second operand 11 states. [2019-09-08 12:00:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:29,785 INFO L93 Difference]: Finished difference Result 843 states and 1133 transitions. [2019-09-08 12:00:29,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:00:29,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-09-08 12:00:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:29,787 INFO L225 Difference]: With dead ends: 843 [2019-09-08 12:00:29,787 INFO L226 Difference]: Without dead ends: 699 [2019-09-08 12:00:29,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:00:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-09-08 12:00:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 345. [2019-09-08 12:00:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-08 12:00:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 431 transitions. [2019-09-08 12:00:29,896 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 431 transitions. Word has length 88 [2019-09-08 12:00:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:29,896 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 431 transitions. [2019-09-08 12:00:29,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:00:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 431 transitions. [2019-09-08 12:00:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:00:29,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:29,897 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] [2019-09-08 12:00:29,898 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:29,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1795581947, now seen corresponding path program 1 times [2019-09-08 12:00:29,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:29,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:29,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:29,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:29,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:30,892 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 12:00:30,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:30,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:00:30,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:00:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:00:30,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:00:30,894 INFO L87 Difference]: Start difference. First operand 345 states and 431 transitions. Second operand 14 states. [2019-09-08 12:00:31,781 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-08 12:00:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:32,715 INFO L93 Difference]: Finished difference Result 770 states and 1043 transitions. [2019-09-08 12:00:32,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:00:32,716 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-09-08 12:00:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:32,717 INFO L225 Difference]: With dead ends: 770 [2019-09-08 12:00:32,717 INFO L226 Difference]: Without dead ends: 742 [2019-09-08 12:00:32,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:00:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-08 12:00:32,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 325. [2019-09-08 12:00:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-09-08 12:00:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 407 transitions. [2019-09-08 12:00:32,816 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 407 transitions. Word has length 89 [2019-09-08 12:00:32,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:32,816 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 407 transitions. [2019-09-08 12:00:32,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:00:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 407 transitions. [2019-09-08 12:00:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:00:32,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:32,817 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] [2019-09-08 12:00:32,817 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash -842661870, now seen corresponding path program 1 times [2019-09-08 12:00:32,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:32,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:32,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:32,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:32,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:33,483 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 12:00:33,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:33,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:00:33,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:00:33,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:00:33,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:00:33,484 INFO L87 Difference]: Start difference. First operand 325 states and 407 transitions. Second operand 15 states. [2019-09-08 12:00:34,506 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 12:00:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:35,361 INFO L93 Difference]: Finished difference Result 641 states and 854 transitions. [2019-09-08 12:00:35,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:00:35,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2019-09-08 12:00:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:35,362 INFO L225 Difference]: With dead ends: 641 [2019-09-08 12:00:35,362 INFO L226 Difference]: Without dead ends: 503 [2019-09-08 12:00:35,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:00:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-09-08 12:00:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 315. [2019-09-08 12:00:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 12:00:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 396 transitions. [2019-09-08 12:00:35,449 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 396 transitions. Word has length 89 [2019-09-08 12:00:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:35,450 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 396 transitions. [2019-09-08 12:00:35,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:00:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 396 transitions. [2019-09-08 12:00:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:00:35,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:35,451 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] [2019-09-08 12:00:35,451 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash -898185746, now seen corresponding path program 1 times [2019-09-08 12:00:35,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:35,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:35,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:35,596 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 12:00:35,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:35,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:00:35,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:00:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:00:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:00:35,597 INFO L87 Difference]: Start difference. First operand 315 states and 396 transitions. Second operand 9 states. [2019-09-08 12:00:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:36,990 INFO L93 Difference]: Finished difference Result 514 states and 663 transitions. [2019-09-08 12:00:36,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:00:36,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 12:00:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:36,991 INFO L225 Difference]: With dead ends: 514 [2019-09-08 12:00:36,991 INFO L226 Difference]: Without dead ends: 507 [2019-09-08 12:00:36,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:00:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-08 12:00:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 315. [2019-09-08 12:00:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 12:00:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 395 transitions. [2019-09-08 12:00:37,094 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 395 transitions. Word has length 89 [2019-09-08 12:00:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:37,094 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 395 transitions. [2019-09-08 12:00:37,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:00:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 395 transitions. [2019-09-08 12:00:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 12:00:37,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:37,095 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] [2019-09-08 12:00:37,096 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash -887818152, now seen corresponding path program 1 times [2019-09-08 12:00:37,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:37,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:37,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:37,219 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 12:00:37,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:37,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:00:37,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:00:37,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:00:37,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:00:37,220 INFO L87 Difference]: Start difference. First operand 315 states and 395 transitions. Second operand 9 states. [2019-09-08 12:00:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:38,270 INFO L93 Difference]: Finished difference Result 514 states and 661 transitions. [2019-09-08 12:00:38,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:00:38,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 12:00:38,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:38,271 INFO L225 Difference]: With dead ends: 514 [2019-09-08 12:00:38,272 INFO L226 Difference]: Without dead ends: 507 [2019-09-08 12:00:38,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:00:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-09-08 12:00:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 315. [2019-09-08 12:00:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 12:00:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 394 transitions. [2019-09-08 12:00:38,421 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 394 transitions. Word has length 89 [2019-09-08 12:00:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:38,421 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 394 transitions. [2019-09-08 12:00:38,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:00:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 394 transitions. [2019-09-08 12:00:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:00:38,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:38,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:38,423 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:38,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash 576556054, now seen corresponding path program 1 times [2019-09-08 12:00:38,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:38,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:38,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:38,997 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 12:00:38,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:38,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:00:38,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:00:38,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:00:38,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:00:38,999 INFO L87 Difference]: Start difference. First operand 315 states and 394 transitions. Second operand 13 states. [2019-09-08 12:00:39,529 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-08 12:00:39,658 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-08 12:00:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:41,051 INFO L93 Difference]: Finished difference Result 1065 states and 1458 transitions. [2019-09-08 12:00:41,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:00:41,051 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2019-09-08 12:00:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:41,053 INFO L225 Difference]: With dead ends: 1065 [2019-09-08 12:00:41,053 INFO L226 Difference]: Without dead ends: 1059 [2019-09-08 12:00:41,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:00:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-09-08 12:00:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 309. [2019-09-08 12:00:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-09-08 12:00:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 387 transitions. [2019-09-08 12:00:41,147 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 387 transitions. Word has length 90 [2019-09-08 12:00:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:41,147 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 387 transitions. [2019-09-08 12:00:41,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:00:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 387 transitions. [2019-09-08 12:00:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:00:41,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:41,148 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] [2019-09-08 12:00:41,148 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:41,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1811224677, now seen corresponding path program 1 times [2019-09-08 12:00:41,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:41,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:41,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:41,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:41,953 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 12:00:41,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:41,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:00:41,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:00:41,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:00:41,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:00:41,955 INFO L87 Difference]: Start difference. First operand 309 states and 387 transitions. Second operand 15 states. [2019-09-08 12:00:42,086 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-09-08 12:00:42,514 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-08 12:00:42,718 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-09-08 12:00:42,904 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 12:00:43,076 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-08 12:00:43,247 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 12:00:43,452 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-08 12:00:43,590 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-08 12:00:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:43,907 INFO L93 Difference]: Finished difference Result 309 states and 387 transitions. [2019-09-08 12:00:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:00:43,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-09-08 12:00:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:43,911 INFO L225 Difference]: With dead ends: 309 [2019-09-08 12:00:43,911 INFO L226 Difference]: Without dead ends: 279 [2019-09-08 12:00:43,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:00:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-08 12:00:43,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2019-09-08 12:00:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-08 12:00:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 354 transitions. [2019-09-08 12:00:43,996 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 354 transitions. Word has length 91 [2019-09-08 12:00:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:43,996 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 354 transitions. [2019-09-08 12:00:43,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:00:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 354 transitions. [2019-09-08 12:00:43,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:00:43,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:43,998 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] [2019-09-08 12:00:43,998 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1377085776, now seen corresponding path program 1 times [2019-09-08 12:00:43,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:43,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:43,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:43,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:46,228 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 12:00:46,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:46,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 12:00:46,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 12:00:46,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 12:00:46,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:00:46,230 INFO L87 Difference]: Start difference. First operand 279 states and 354 transitions. Second operand 28 states. [2019-09-08 12:00:46,462 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:00:46,917 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-08 12:00:47,084 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-08 12:00:47,295 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-09-08 12:00:47,494 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-09-08 12:00:47,723 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-08 12:00:47,953 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-08 12:00:48,276 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-08 12:00:48,835 WARN L188 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-09-08 12:00:49,304 WARN L188 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-08 12:00:49,827 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-09-08 12:00:50,426 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-08 12:00:50,848 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-09-08 12:00:51,256 WARN L188 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-09-08 12:00:51,472 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 12:00:52,103 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-08 12:00:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:54,723 INFO L93 Difference]: Finished difference Result 479 states and 623 transitions. [2019-09-08 12:00:54,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 12:00:54,723 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-09-08 12:00:54,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:54,724 INFO L225 Difference]: With dead ends: 479 [2019-09-08 12:00:54,724 INFO L226 Difference]: Without dead ends: 471 [2019-09-08 12:00:54,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=453, Invalid=2409, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 12:00:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-09-08 12:00:54,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 284. [2019-09-08 12:00:54,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-08 12:00:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 359 transitions. [2019-09-08 12:00:54,820 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 359 transitions. Word has length 91 [2019-09-08 12:00:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:54,821 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 359 transitions. [2019-09-08 12:00:54,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 12:00:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 359 transitions. [2019-09-08 12:00:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:00:54,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:54,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:54,821 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash 122315771, now seen corresponding path program 1 times [2019-09-08 12:00:54,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:54,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:54,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:54,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:54,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:55,229 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 12:00:55,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:55,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:00:55,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:00:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:00:55,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:00:55,230 INFO L87 Difference]: Start difference. First operand 284 states and 359 transitions. Second operand 12 states. [2019-09-08 12:00:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:55,977 INFO L93 Difference]: Finished difference Result 462 states and 607 transitions. [2019-09-08 12:00:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:00:55,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2019-09-08 12:00:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:55,978 INFO L225 Difference]: With dead ends: 462 [2019-09-08 12:00:55,978 INFO L226 Difference]: Without dead ends: 433 [2019-09-08 12:00:55,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:00:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-08 12:00:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 255. [2019-09-08 12:00:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 12:00:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 328 transitions. [2019-09-08 12:00:56,063 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 328 transitions. Word has length 92 [2019-09-08 12:00:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:56,063 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 328 transitions. [2019-09-08 12:00:56,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:00:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 328 transitions. [2019-09-08 12:00:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:00:56,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:56,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:56,064 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:56,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1222425115, now seen corresponding path program 1 times [2019-09-08 12:00:56,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:56,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:56,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:56,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:56,138 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 12:00:56,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:56,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:00:56,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:00:56,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:00:56,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:00:56,139 INFO L87 Difference]: Start difference. First operand 255 states and 328 transitions. Second operand 3 states. [2019-09-08 12:00:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:56,362 INFO L93 Difference]: Finished difference Result 503 states and 692 transitions. [2019-09-08 12:00:56,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:00:56,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 12:00:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:56,363 INFO L225 Difference]: With dead ends: 503 [2019-09-08 12:00:56,363 INFO L226 Difference]: Without dead ends: 375 [2019-09-08 12:00:56,364 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 12:00:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-08 12:00:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2019-09-08 12:00:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-09-08 12:00:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 499 transitions. [2019-09-08 12:00:56,515 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 499 transitions. Word has length 118 [2019-09-08 12:00:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:56,515 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 499 transitions. [2019-09-08 12:00:56,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:00:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 499 transitions. [2019-09-08 12:00:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:00:56,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:56,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:56,516 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash -547792204, now seen corresponding path program 1 times [2019-09-08 12:00:56,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:56,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:56,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:56,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:56,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:56,630 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 12:00:56,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:56,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:00:56,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:00:56,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:00:56,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:00:56,631 INFO L87 Difference]: Start difference. First operand 373 states and 499 transitions. Second operand 7 states. [2019-09-08 12:00:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:57,507 INFO L93 Difference]: Finished difference Result 1141 states and 1603 transitions. [2019-09-08 12:00:57,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:00:57,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:00:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:57,509 INFO L225 Difference]: With dead ends: 1141 [2019-09-08 12:00:57,509 INFO L226 Difference]: Without dead ends: 895 [2019-09-08 12:00:57,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:00:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-09-08 12:00:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 433. [2019-09-08 12:00:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-09-08 12:00:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 581 transitions. [2019-09-08 12:00:57,697 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 581 transitions. Word has length 120 [2019-09-08 12:00:57,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:57,697 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 581 transitions. [2019-09-08 12:00:57,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:00:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 581 transitions. [2019-09-08 12:00:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:00:57,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:57,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:57,699 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash 479664936, now seen corresponding path program 1 times [2019-09-08 12:00:57,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:57,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:57,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:57,788 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 12:00:57,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:57,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:00:57,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:00:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:00:57,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:00:57,789 INFO L87 Difference]: Start difference. First operand 433 states and 581 transitions. Second operand 7 states. [2019-09-08 12:00:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:00:59,169 INFO L93 Difference]: Finished difference Result 1865 states and 2641 transitions. [2019-09-08 12:00:59,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:00:59,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:00:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:00:59,170 INFO L225 Difference]: With dead ends: 1865 [2019-09-08 12:00:59,170 INFO L226 Difference]: Without dead ends: 1559 [2019-09-08 12:00:59,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:00:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2019-09-08 12:00:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 777. [2019-09-08 12:00:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-09-08 12:00:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1079 transitions. [2019-09-08 12:00:59,556 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1079 transitions. Word has length 120 [2019-09-08 12:00:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:00:59,557 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1079 transitions. [2019-09-08 12:00:59,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:00:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1079 transitions. [2019-09-08 12:00:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:00:59,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:00:59,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:00:59,558 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:00:59,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:00:59,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2044549086, now seen corresponding path program 1 times [2019-09-08 12:00:59,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:00:59,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:00:59,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:59,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:00:59,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:00:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:00:59,670 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 12:00:59,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:00:59,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:00:59,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:00:59,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:00:59,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:00:59,672 INFO L87 Difference]: Start difference. First operand 777 states and 1079 transitions. Second operand 7 states. [2019-09-08 12:01:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:01,835 INFO L93 Difference]: Finished difference Result 3633 states and 5179 transitions. [2019-09-08 12:01:01,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:01:01,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:01:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:01,838 INFO L225 Difference]: With dead ends: 3633 [2019-09-08 12:01:01,838 INFO L226 Difference]: Without dead ends: 2983 [2019-09-08 12:01:01,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:01:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2019-09-08 12:01:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1505. [2019-09-08 12:01:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2019-09-08 12:01:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2131 transitions. [2019-09-08 12:01:02,637 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2131 transitions. Word has length 120 [2019-09-08 12:01:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:02,637 INFO L475 AbstractCegarLoop]: Abstraction has 1505 states and 2131 transitions. [2019-09-08 12:01:02,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:01:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2131 transitions. [2019-09-08 12:01:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:01:02,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:02,639 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:01:02,639 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:02,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1636775367, now seen corresponding path program 1 times [2019-09-08 12:01:02,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:02,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:02,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:02,712 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 12:01:02,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:01:02,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:01:02,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:01:02,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:01:02,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:01:02,713 INFO L87 Difference]: Start difference. First operand 1505 states and 2131 transitions. Second operand 3 states. [2019-09-08 12:01:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:03,927 INFO L93 Difference]: Finished difference Result 3605 states and 5177 transitions. [2019-09-08 12:01:03,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:01:03,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:01:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:03,930 INFO L225 Difference]: With dead ends: 3605 [2019-09-08 12:01:03,930 INFO L226 Difference]: Without dead ends: 2227 [2019-09-08 12:01:03,932 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 12:01:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-09-08 12:01:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2225. [2019-09-08 12:01:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2225 states. [2019-09-08 12:01:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3151 transitions. [2019-09-08 12:01:05,123 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3151 transitions. Word has length 120 [2019-09-08 12:01:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:05,124 INFO L475 AbstractCegarLoop]: Abstraction has 2225 states and 3151 transitions. [2019-09-08 12:01:05,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:01:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3151 transitions. [2019-09-08 12:01:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:01:05,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:05,125 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:01:05,125 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash 897035046, now seen corresponding path program 1 times [2019-09-08 12:01:05,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:05,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:05,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:05,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:05,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:05,181 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 12:01:05,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:01:05,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:01:05,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:01:05,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:01:05,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:01:05,182 INFO L87 Difference]: Start difference. First operand 2225 states and 3151 transitions. Second operand 3 states. [2019-09-08 12:01:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:07,600 INFO L93 Difference]: Finished difference Result 6197 states and 8809 transitions. [2019-09-08 12:01:07,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:01:07,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:01:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:07,604 INFO L225 Difference]: With dead ends: 6197 [2019-09-08 12:01:07,604 INFO L226 Difference]: Without dead ends: 4099 [2019-09-08 12:01:07,607 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 12:01:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2019-09-08 12:01:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 4097. [2019-09-08 12:01:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4097 states. [2019-09-08 12:01:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 5731 transitions. [2019-09-08 12:01:09,992 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 5731 transitions. Word has length 120 [2019-09-08 12:01:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:09,992 INFO L475 AbstractCegarLoop]: Abstraction has 4097 states and 5731 transitions. [2019-09-08 12:01:09,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:01:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 5731 transitions. [2019-09-08 12:01:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:01:09,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:09,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:01:09,994 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:09,994 INFO L82 PathProgramCache]: Analyzing trace with hash 268696988, now seen corresponding path program 1 times [2019-09-08 12:01:09,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:09,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:09,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:09,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:09,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:10,094 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 12:01:10,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:01:10,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:01:10,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:01:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:01:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:01:10,096 INFO L87 Difference]: Start difference. First operand 4097 states and 5731 transitions. Second operand 7 states. [2019-09-08 12:01:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:19,411 INFO L93 Difference]: Finished difference Result 18985 states and 26663 transitions. [2019-09-08 12:01:19,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:01:19,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:01:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:19,424 INFO L225 Difference]: With dead ends: 18985 [2019-09-08 12:01:19,424 INFO L226 Difference]: Without dead ends: 15015 [2019-09-08 12:01:19,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:01:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15015 states. [2019-09-08 12:01:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15015 to 8545. [2019-09-08 12:01:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8545 states. [2019-09-08 12:01:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8545 states to 8545 states and 11995 transitions. [2019-09-08 12:01:24,763 INFO L78 Accepts]: Start accepts. Automaton has 8545 states and 11995 transitions. Word has length 120 [2019-09-08 12:01:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:24,764 INFO L475 AbstractCegarLoop]: Abstraction has 8545 states and 11995 transitions. [2019-09-08 12:01:24,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:01:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 8545 states and 11995 transitions. [2019-09-08 12:01:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:01:24,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:24,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:01:24,766 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1180739922, now seen corresponding path program 1 times [2019-09-08 12:01:24,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:24,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:24,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:24,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:24,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:24,874 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 12:01:24,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:01:24,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:01:24,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:01:24,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:01:24,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:01:24,875 INFO L87 Difference]: Start difference. First operand 8545 states and 11995 transitions. Second operand 7 states. [2019-09-08 12:01:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:01:39,228 INFO L93 Difference]: Finished difference Result 32777 states and 46185 transitions. [2019-09-08 12:01:39,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:01:39,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2019-09-08 12:01:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:01:39,250 INFO L225 Difference]: With dead ends: 32777 [2019-09-08 12:01:39,250 INFO L226 Difference]: Without dead ends: 24359 [2019-09-08 12:01:39,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:01:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24359 states. [2019-09-08 12:01:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24359 to 14225. [2019-09-08 12:01:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14225 states. [2019-09-08 12:01:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14225 states to 14225 states and 20003 transitions. [2019-09-08 12:01:47,323 INFO L78 Accepts]: Start accepts. Automaton has 14225 states and 20003 transitions. Word has length 120 [2019-09-08 12:01:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:01:47,323 INFO L475 AbstractCegarLoop]: Abstraction has 14225 states and 20003 transitions. [2019-09-08 12:01:47,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:01:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 14225 states and 20003 transitions. [2019-09-08 12:01:47,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:01:47,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:01:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:47,326 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:01:47,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:01:47,326 INFO L82 PathProgramCache]: Analyzing trace with hash -858738670, now seen corresponding path program 1 times [2019-09-08 12:01:47,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:01:47,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:01:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:47,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:01:47,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:01:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:01:47,420 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 12:01:47,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:01:47,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:01:47,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:01:47,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:01:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:01:47,421 INFO L87 Difference]: Start difference. First operand 14225 states and 20003 transitions. Second operand 6 states. [2019-09-08 12:02:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:01,681 INFO L93 Difference]: Finished difference Result 23575 states and 32743 transitions. [2019-09-08 12:02:01,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:02:01,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-08 12:02:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:01,701 INFO L225 Difference]: With dead ends: 23575 [2019-09-08 12:02:01,701 INFO L226 Difference]: Without dead ends: 23573 [2019-09-08 12:02:01,705 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 12:02:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23573 states. [2019-09-08 12:02:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23573 to 14417. [2019-09-08 12:02:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14417 states. [2019-09-08 12:02:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14417 states to 14417 states and 20131 transitions. [2019-09-08 12:02:09,989 INFO L78 Accepts]: Start accepts. Automaton has 14417 states and 20131 transitions. Word has length 121 [2019-09-08 12:02:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:09,990 INFO L475 AbstractCegarLoop]: Abstraction has 14417 states and 20131 transitions. [2019-09-08 12:02:09,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:02:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 14417 states and 20131 transitions. [2019-09-08 12:02:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:02:09,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:09,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:09,992 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:09,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:09,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1840238826, now seen corresponding path program 1 times [2019-09-08 12:02:09,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:09,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:09,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:10,053 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 12:02:10,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:10,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:10,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:10,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:10,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:10,055 INFO L87 Difference]: Start difference. First operand 14417 states and 20131 transitions. Second operand 3 states. [2019-09-08 12:02:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:18,090 INFO L93 Difference]: Finished difference Result 27845 states and 38829 transitions. [2019-09-08 12:02:18,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:18,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 12:02:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:18,102 INFO L225 Difference]: With dead ends: 27845 [2019-09-08 12:02:18,102 INFO L226 Difference]: Without dead ends: 13555 [2019-09-08 12:02:18,116 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 12:02:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13555 states. [2019-09-08 12:02:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13555 to 10305. [2019-09-08 12:02:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10305 states. [2019-09-08 12:02:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10305 states to 10305 states and 14197 transitions. [2019-09-08 12:02:24,739 INFO L78 Accepts]: Start accepts. Automaton has 10305 states and 14197 transitions. Word has length 121 [2019-09-08 12:02:24,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:24,739 INFO L475 AbstractCegarLoop]: Abstraction has 10305 states and 14197 transitions. [2019-09-08 12:02:24,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 10305 states and 14197 transitions. [2019-09-08 12:02:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:02:24,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:24,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:24,741 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:24,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:24,741 INFO L82 PathProgramCache]: Analyzing trace with hash -878954728, now seen corresponding path program 1 times [2019-09-08 12:02:24,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:24,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:24,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:24,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:24,810 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 12:02:24,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:24,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:24,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:24,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:24,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:24,811 INFO L87 Difference]: Start difference. First operand 10305 states and 14197 transitions. Second operand 3 states. [2019-09-08 12:02:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:34,226 INFO L93 Difference]: Finished difference Result 26317 states and 36495 transitions. [2019-09-08 12:02:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:34,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 12:02:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:34,240 INFO L225 Difference]: With dead ends: 26317 [2019-09-08 12:02:34,241 INFO L226 Difference]: Without dead ends: 16139 [2019-09-08 12:02:34,252 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 12:02:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2019-09-08 12:02:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 15273. [2019-09-08 12:02:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15273 states. [2019-09-08 12:02:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15273 states to 15273 states and 21211 transitions. [2019-09-08 12:02:43,193 INFO L78 Accepts]: Start accepts. Automaton has 15273 states and 21211 transitions. Word has length 122 [2019-09-08 12:02:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:02:43,194 INFO L475 AbstractCegarLoop]: Abstraction has 15273 states and 21211 transitions. [2019-09-08 12:02:43,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:02:43,194 INFO L276 IsEmpty]: Start isEmpty. Operand 15273 states and 21211 transitions. [2019-09-08 12:02:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:02:43,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:02:43,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:02:43,196 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:02:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:02:43,196 INFO L82 PathProgramCache]: Analyzing trace with hash 305451551, now seen corresponding path program 1 times [2019-09-08 12:02:43,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:02:43,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:02:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:43,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:02:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:02:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:02:43,260 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 12:02:43,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:02:43,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:02:43,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:02:43,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:02:43,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:02:43,261 INFO L87 Difference]: Start difference. First operand 15273 states and 21211 transitions. Second operand 3 states. [2019-09-08 12:02:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:52,592 INFO L93 Difference]: Finished difference Result 29809 states and 41385 transitions. [2019-09-08 12:02:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:02:52,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 12:02:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:52,604 INFO L225 Difference]: With dead ends: 29809 [2019-09-08 12:02:52,605 INFO L226 Difference]: Without dead ends: 14663 [2019-09-08 12:02:52,619 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 12:02:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14663 states. [2019-09-08 12:03:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14663 to 14661. [2019-09-08 12:03:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14661 states. [2019-09-08 12:03:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14661 states to 14661 states and 20191 transitions. [2019-09-08 12:03:01,293 INFO L78 Accepts]: Start accepts. Automaton has 14661 states and 20191 transitions. Word has length 123 [2019-09-08 12:03:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:01,293 INFO L475 AbstractCegarLoop]: Abstraction has 14661 states and 20191 transitions. [2019-09-08 12:03:01,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:03:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 14661 states and 20191 transitions. [2019-09-08 12:03:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:03:01,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:01,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:01,294 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1983664206, now seen corresponding path program 1 times [2019-09-08 12:03:01,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:01,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:01,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:01,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:01,350 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 12:03:01,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:01,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:03:01,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:03:01,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:03:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:03:01,351 INFO L87 Difference]: Start difference. First operand 14661 states and 20191 transitions. Second operand 3 states. [2019-09-08 12:03:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:10,843 INFO L93 Difference]: Finished difference Result 30613 states and 42245 transitions. [2019-09-08 12:03:10,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:10,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 12:03:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:10,857 INFO L225 Difference]: With dead ends: 30613 [2019-09-08 12:03:10,857 INFO L226 Difference]: Without dead ends: 16079 [2019-09-08 12:03:10,873 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 12:03:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16079 states. [2019-09-08 12:03:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16079 to 16077. [2019-09-08 12:03:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16077 states. [2019-09-08 12:03:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16077 states to 16077 states and 22095 transitions. [2019-09-08 12:03:20,317 INFO L78 Accepts]: Start accepts. Automaton has 16077 states and 22095 transitions. Word has length 124 [2019-09-08 12:03:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:20,318 INFO L475 AbstractCegarLoop]: Abstraction has 16077 states and 22095 transitions. [2019-09-08 12:03:20,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:03:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 16077 states and 22095 transitions. [2019-09-08 12:03:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:03:20,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:20,322 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:03:20,322 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:20,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:20,322 INFO L82 PathProgramCache]: Analyzing trace with hash 419309208, now seen corresponding path program 1 times [2019-09-08 12:03:20,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:20,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:20,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:20,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:20,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:03:20,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:20,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:03:20,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:03:20,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:03:20,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:03:20,395 INFO L87 Difference]: Start difference. First operand 16077 states and 22095 transitions. Second operand 3 states. [2019-09-08 12:03:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:29,912 INFO L93 Difference]: Finished difference Result 30769 states and 42133 transitions. [2019-09-08 12:03:29,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:29,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 12:03:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:29,924 INFO L225 Difference]: With dead ends: 30769 [2019-09-08 12:03:29,925 INFO L226 Difference]: Without dead ends: 14819 [2019-09-08 12:03:29,935 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 12:03:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14819 states. [2019-09-08 12:03:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14819 to 14457. [2019-09-08 12:03:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14457 states. [2019-09-08 12:03:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14457 states to 14457 states and 19545 transitions. [2019-09-08 12:03:38,772 INFO L78 Accepts]: Start accepts. Automaton has 14457 states and 19545 transitions. Word has length 155 [2019-09-08 12:03:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:03:38,772 INFO L475 AbstractCegarLoop]: Abstraction has 14457 states and 19545 transitions. [2019-09-08 12:03:38,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:03:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 14457 states and 19545 transitions. [2019-09-08 12:03:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 12:03:38,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:03:38,776 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, 1, 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:03:38,776 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:03:38,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:03:38,776 INFO L82 PathProgramCache]: Analyzing trace with hash -430845502, now seen corresponding path program 1 times [2019-09-08 12:03:38,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:03:38,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:03:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:38,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:03:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:03:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:03:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:03:38,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:03:38,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:03:38,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:03:38,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:03:38,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:03:38,904 INFO L87 Difference]: Start difference. First operand 14457 states and 19545 transitions. Second operand 3 states. [2019-09-08 12:03:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:03:50,143 INFO L93 Difference]: Finished difference Result 31885 states and 42995 transitions. [2019-09-08 12:03:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:03:50,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 12:03:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:03:50,165 INFO L225 Difference]: With dead ends: 31885 [2019-09-08 12:03:50,165 INFO L226 Difference]: Without dead ends: 17555 [2019-09-08 12:03:50,178 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 12:03:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17555 states. [2019-09-08 12:04:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17555 to 16753. [2019-09-08 12:04:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16753 states. [2019-09-08 12:04:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16753 states to 16753 states and 22387 transitions. [2019-09-08 12:04:00,795 INFO L78 Accepts]: Start accepts. Automaton has 16753 states and 22387 transitions. Word has length 156 [2019-09-08 12:04:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:00,795 INFO L475 AbstractCegarLoop]: Abstraction has 16753 states and 22387 transitions. [2019-09-08 12:04:00,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:04:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 16753 states and 22387 transitions. [2019-09-08 12:04:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 12:04:00,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:00,799 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, 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:04:00,800 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1504022855, now seen corresponding path program 1 times [2019-09-08 12:04:00,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:00,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:00,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 12:04:00,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:00,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:00,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:00,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:00,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:00,925 INFO L87 Difference]: Start difference. First operand 16753 states and 22387 transitions. Second operand 5 states. [2019-09-08 12:04:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:19,342 INFO L93 Difference]: Finished difference Result 44727 states and 59670 transitions. [2019-09-08 12:04:19,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:19,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 12:04:19,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:19,368 INFO L225 Difference]: With dead ends: 44727 [2019-09-08 12:04:19,368 INFO L226 Difference]: Without dead ends: 28101 [2019-09-08 12:04:19,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:04:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28101 states. [2019-09-08 12:04:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28101 to 22121. [2019-09-08 12:04:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22121 states. [2019-09-08 12:04:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22121 states to 22121 states and 29555 transitions. [2019-09-08 12:04:33,862 INFO L78 Accepts]: Start accepts. Automaton has 22121 states and 29555 transitions. Word has length 157 [2019-09-08 12:04:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:04:33,862 INFO L475 AbstractCegarLoop]: Abstraction has 22121 states and 29555 transitions. [2019-09-08 12:04:33,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:04:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 22121 states and 29555 transitions. [2019-09-08 12:04:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 12:04:33,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:04:33,866 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, 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:04:33,867 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:04:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:04:33,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1763487301, now seen corresponding path program 1 times [2019-09-08 12:04:33,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:04:33,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:04:33,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:33,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:04:33,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:04:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:04:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:04:33,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:04:33,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:04:33,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:04:33,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:04:33,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:04:33,966 INFO L87 Difference]: Start difference. First operand 22121 states and 29555 transitions. Second operand 5 states. [2019-09-08 12:04:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:04:56,015 INFO L93 Difference]: Finished difference Result 55651 states and 74238 transitions. [2019-09-08 12:04:56,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:04:56,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 12:04:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:04:56,046 INFO L225 Difference]: With dead ends: 55651 [2019-09-08 12:04:56,046 INFO L226 Difference]: Without dead ends: 33657 [2019-09-08 12:04:56,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:04:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33657 states. [2019-09-08 12:05:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33657 to 27489. [2019-09-08 12:05:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27489 states. [2019-09-08 12:05:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27489 states to 27489 states and 36723 transitions. [2019-09-08 12:05:15,027 INFO L78 Accepts]: Start accepts. Automaton has 27489 states and 36723 transitions. Word has length 157 [2019-09-08 12:05:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:05:15,028 INFO L475 AbstractCegarLoop]: Abstraction has 27489 states and 36723 transitions. [2019-09-08 12:05:15,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:05:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27489 states and 36723 transitions. [2019-09-08 12:05:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 12:05:15,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:05:15,033 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, 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:05:15,033 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:05:15,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:05:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash 7265973, now seen corresponding path program 1 times [2019-09-08 12:05:15,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:05:15,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:05:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:15,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:05:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:05:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:05:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:05:15,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:05:15,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:05:15,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:05:15,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:05:15,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:05:15,148 INFO L87 Difference]: Start difference. First operand 27489 states and 36723 transitions. Second operand 5 states. [2019-09-08 12:05:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:05:40,712 INFO L93 Difference]: Finished difference Result 65991 states and 88022 transitions. [2019-09-08 12:05:40,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:05:40,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 12:05:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:05:40,749 INFO L225 Difference]: With dead ends: 65991 [2019-09-08 12:05:40,749 INFO L226 Difference]: Without dead ends: 38629 [2019-09-08 12:05:40,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:05:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38629 states. [2019-09-08 12:06:03,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38629 to 32857. [2019-09-08 12:06:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32857 states. [2019-09-08 12:06:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32857 states to 32857 states and 43891 transitions. [2019-09-08 12:06:03,518 INFO L78 Accepts]: Start accepts. Automaton has 32857 states and 43891 transitions. Word has length 157 [2019-09-08 12:06:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:03,519 INFO L475 AbstractCegarLoop]: Abstraction has 32857 states and 43891 transitions. [2019-09-08 12:06:03,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:06:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 32857 states and 43891 transitions. [2019-09-08 12:06:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 12:06:03,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:03,524 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, 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:06:03,524 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:03,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1974455249, now seen corresponding path program 1 times [2019-09-08 12:06:03,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:03,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:03,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:03,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:03,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 12:06:03,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:03,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:06:03,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:06:03,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:06:03,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:06:03,641 INFO L87 Difference]: Start difference. First operand 32857 states and 43891 transitions. Second operand 5 states. [2019-09-08 12:06:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:06:32,480 INFO L93 Difference]: Finished difference Result 76439 states and 101950 transitions. [2019-09-08 12:06:32,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:06:32,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 12:06:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:06:32,520 INFO L225 Difference]: With dead ends: 76439 [2019-09-08 12:06:32,520 INFO L226 Difference]: Without dead ends: 43709 [2019-09-08 12:06:32,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:06:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43709 states. [2019-09-08 12:06:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43709 to 38225. [2019-09-08 12:06:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38225 states. [2019-09-08 12:06:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38225 states to 38225 states and 51059 transitions. [2019-09-08 12:06:58,965 INFO L78 Accepts]: Start accepts. Automaton has 38225 states and 51059 transitions. Word has length 157 [2019-09-08 12:06:58,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:06:58,965 INFO L475 AbstractCegarLoop]: Abstraction has 38225 states and 51059 transitions. [2019-09-08 12:06:58,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:06:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 38225 states and 51059 transitions. [2019-09-08 12:06:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 12:06:58,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:06:58,971 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, 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:06:58,971 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:06:58,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:06:58,971 INFO L82 PathProgramCache]: Analyzing trace with hash 871075137, now seen corresponding path program 1 times [2019-09-08 12:06:58,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:06:58,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:06:58,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:58,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:06:58,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:06:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:06:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 12:06:59,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:06:59,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:06:59,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:06:59,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:06:59,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:06:59,106 INFO L87 Difference]: Start difference. First operand 38225 states and 51059 transitions. Second operand 7 states. [2019-09-08 12:08:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:08:32,135 INFO L93 Difference]: Finished difference Result 175581 states and 234401 transitions. [2019-09-08 12:08:32,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:08:32,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2019-09-08 12:08:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:08:32,371 INFO L225 Difference]: With dead ends: 175581 [2019-09-08 12:08:32,372 INFO L226 Difference]: Without dead ends: 137483 [2019-09-08 12:08:32,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:08:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137483 states. [2019-09-08 12:09:06,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137483 to 48833. [2019-09-08 12:09:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48833 states. [2019-09-08 12:09:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48833 states to 48833 states and 65075 transitions. [2019-09-08 12:09:06,264 INFO L78 Accepts]: Start accepts. Automaton has 48833 states and 65075 transitions. Word has length 157 [2019-09-08 12:09:06,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:09:06,265 INFO L475 AbstractCegarLoop]: Abstraction has 48833 states and 65075 transitions. [2019-09-08 12:09:06,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:09:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 48833 states and 65075 transitions. [2019-09-08 12:09:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 12:09:06,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:09:06,272 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, 1, 1, 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:09:06,272 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:09:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:09:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1636485859, now seen corresponding path program 1 times [2019-09-08 12:09:06,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:09:06,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:09:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:06,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:09:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:09:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:09:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 12:09:06,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:09:06,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:09:06,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:09:06,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:09:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:09:06,426 INFO L87 Difference]: Start difference. First operand 48833 states and 65075 transitions. Second operand 9 states. [2019-09-08 12:10:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:10:16,747 INFO L93 Difference]: Finished difference Result 147627 states and 196335 transitions. [2019-09-08 12:10:16,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:10:16,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-09-08 12:10:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:10:16,846 INFO L225 Difference]: With dead ends: 147627 [2019-09-08 12:10:16,846 INFO L226 Difference]: Without dead ends: 98909 [2019-09-08 12:10:16,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:10:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98909 states. [2019-09-08 12:10:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98909 to 48833. [2019-09-08 12:10:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48833 states. [2019-09-08 12:10:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48833 states to 48833 states and 65073 transitions. [2019-09-08 12:10:50,355 INFO L78 Accepts]: Start accepts. Automaton has 48833 states and 65073 transitions. Word has length 158 [2019-09-08 12:10:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:10:50,356 INFO L475 AbstractCegarLoop]: Abstraction has 48833 states and 65073 transitions. [2019-09-08 12:10:50,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:10:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 48833 states and 65073 transitions. [2019-09-08 12:10:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 12:10:50,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:10:50,363 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, 1, 1, 1, 1, 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:10:50,363 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:10:50,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:10:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash -831728092, now seen corresponding path program 1 times [2019-09-08 12:10:50,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:10:50,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:10:50,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:50,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:10:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 12:10:50,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:10:50,558 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 12:10:50,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:10:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:10:50,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 12:10:50,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:10:51,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:10:51,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:10:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 12:10:51,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:10:51,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12] total 15 [2019-09-08 12:10:51,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:10:51,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:10:51,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:10:51,664 INFO L87 Difference]: Start difference. First operand 48833 states and 65073 transitions. Second operand 15 states. [2019-09-08 12:10:52,950 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 12:10:53,180 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:10:54,187 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:10:54,481 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:10:55,330 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:10:55,686 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:10:55,986 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 12:10:56,139 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 12:10:56,471 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:10:56,742 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:10:56,976 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:10:57,356 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:10:57,814 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:10:58,182 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:10:58,804 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:10:59,490 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-08 12:10:59,739 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:11:01,021 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:11:01,263 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:11:01,540 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-09-08 12:11:02,610 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:11:02,848 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:11:03,116 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-08 12:11:03,703 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:11:10,749 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 12:11:11,084 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:11:12,957 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:11:13,342 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-09-08 12:11:37,721 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 12:11:38,025 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:11:40,990 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:11:41,329 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:11:43,582 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 12:11:45,384 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-09-08 12:11:46,480 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-09-08 12:11:50,406 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76