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.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:18:14,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:18:14,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:18:14,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:18:14,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:18:14,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:18:14,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:18:14,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:18:14,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:18:14,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:18:14,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:18:14,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:18:14,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:18:14,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:18:14,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:18:14,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:18:14,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:18:14,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:18:14,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:18:14,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:18:14,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:18:14,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:18:14,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:18:14,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:18:14,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:18:14,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:18:14,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:18:14,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:18:14,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:18:14,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:18:14,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:18:14,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:18:14,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:18:14,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:18:14,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:18:14,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:18:14,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:18:14,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:18:14,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:18:14,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:18:14,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:18:14,350 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 12:18:14,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:18:14,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:18:14,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:18:14,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:18:14,381 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:18:14,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:18:14,382 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:18:14,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:18:14,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:18:14,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:18:14,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:18:14,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:18:14,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:18:14,385 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:18:14,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:18:14,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:18:14,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:18:14,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:18:14,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:18:14,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:18:14,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:18:14,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:18:14,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:18:14,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:18:14,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:18:14,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:18:14,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:18:14,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:18:14,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:18:14,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:18:14,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:18:14,450 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:18:14,452 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:18:14,452 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:18:14,453 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-08 12:18:14,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50375f9d2/dfe4a3c865bd4dcca7e1fb8a00dc99f2/FLAG8544a8862 [2019-09-08 12:18:15,260 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:18:15,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-08 12:18:15,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50375f9d2/dfe4a3c865bd4dcca7e1fb8a00dc99f2/FLAG8544a8862 [2019-09-08 12:18:15,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50375f9d2/dfe4a3c865bd4dcca7e1fb8a00dc99f2 [2019-09-08 12:18:15,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:18:15,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:18:15,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:18:15,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:18:15,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:18:15,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:18:15" (1/1) ... [2019-09-08 12:18:15,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:15, skipping insertion in model container [2019-09-08 12:18:15,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:18:15" (1/1) ... [2019-09-08 12:18:15,398 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:18:15,700 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:18:17,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:18:17,500 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:18:18,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:18:18,471 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:18:18,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18 WrapperNode [2019-09-08 12:18:18,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:18:18,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:18:18,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:18:18,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:18:18,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18" (1/1) ... [2019-09-08 12:18:18,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18" (1/1) ... [2019-09-08 12:18:18,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18" (1/1) ... [2019-09-08 12:18:18,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18" (1/1) ... [2019-09-08 12:18:18,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18" (1/1) ... [2019-09-08 12:18:18,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18" (1/1) ... [2019-09-08 12:18:18,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18" (1/1) ... [2019-09-08 12:18:18,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:18:18,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:18:18,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:18:18,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:18:18,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18" (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 12:18:18,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:18:18,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:18:18,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:18:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:18:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:18:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:18:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:18:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:18:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:18:18,976 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:18:18,976 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:18:18,976 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:18:18,977 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:18:18,977 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:18:18,978 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:18:18,978 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:18:18,980 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:18:18,980 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:18:18,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:18:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:18:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:18:25,277 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:18:25,278 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:18:25,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:18:25 BoogieIcfgContainer [2019-09-08 12:18:25,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:18:25,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:18:25,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:18:25,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:18:25,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:18:15" (1/3) ... [2019-09-08 12:18:25,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c0d4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:18:25, skipping insertion in model container [2019-09-08 12:18:25,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:18:18" (2/3) ... [2019-09-08 12:18:25,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c0d4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:18:25, skipping insertion in model container [2019-09-08 12:18:25,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:18:25" (3/3) ... [2019-09-08 12:18:25,297 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-08 12:18:25,312 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:18:25,344 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-08 12:18:25,368 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-08 12:18:25,441 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:18:25,442 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:18:25,442 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:18:25,443 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:18:25,443 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:18:25,443 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:18:25,443 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:18:25,444 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:18:25,444 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:18:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states. [2019-09-08 12:18:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:18:25,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:25,585 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:18:25,590 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:25,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1776998407, now seen corresponding path program 1 times [2019-09-08 12:18:25,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:25,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:25,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:25,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:25,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:26,718 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:18:26,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:26,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:26,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:26,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:26,756 INFO L87 Difference]: Start difference. First operand 2546 states. Second operand 5 states. [2019-09-08 12:18:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:31,284 INFO L93 Difference]: Finished difference Result 4221 states and 7134 transitions. [2019-09-08 12:18:31,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:31,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:18:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:31,322 INFO L225 Difference]: With dead ends: 4221 [2019-09-08 12:18:31,322 INFO L226 Difference]: Without dead ends: 2945 [2019-09-08 12:18:31,332 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 12:18:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2019-09-08 12:18:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2759. [2019-09-08 12:18:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2759 states. [2019-09-08 12:18:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 3623 transitions. [2019-09-08 12:18:31,570 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 3623 transitions. Word has length 91 [2019-09-08 12:18:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:31,571 INFO L475 AbstractCegarLoop]: Abstraction has 2759 states and 3623 transitions. [2019-09-08 12:18:31,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3623 transitions. [2019-09-08 12:18:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:18:31,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:31,584 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:18:31,585 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:31,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:31,586 INFO L82 PathProgramCache]: Analyzing trace with hash 303122164, now seen corresponding path program 1 times [2019-09-08 12:18:31,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:31,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:31,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:31,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:31,978 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:18:31,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:31,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:31,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:31,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:31,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:31,982 INFO L87 Difference]: Start difference. First operand 2759 states and 3623 transitions. Second operand 5 states. [2019-09-08 12:18:33,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:33,874 INFO L93 Difference]: Finished difference Result 3627 states and 4774 transitions. [2019-09-08 12:18:33,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:33,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:18:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:33,887 INFO L225 Difference]: With dead ends: 3627 [2019-09-08 12:18:33,887 INFO L226 Difference]: Without dead ends: 2266 [2019-09-08 12:18:33,891 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 12:18:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-09-08 12:18:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2266. [2019-09-08 12:18:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2266 states. [2019-09-08 12:18:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 3016 transitions. [2019-09-08 12:18:33,982 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 3016 transitions. Word has length 91 [2019-09-08 12:18:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:33,984 INFO L475 AbstractCegarLoop]: Abstraction has 2266 states and 3016 transitions. [2019-09-08 12:18:33,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 3016 transitions. [2019-09-08 12:18:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:18:33,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:33,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] [2019-09-08 12:18:33,992 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:33,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1974545675, now seen corresponding path program 1 times [2019-09-08 12:18:33,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:33,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:33,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:33,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:18:34,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:34,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:34,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:34,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:34,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:34,252 INFO L87 Difference]: Start difference. First operand 2266 states and 3016 transitions. Second operand 5 states. [2019-09-08 12:18:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:35,394 INFO L93 Difference]: Finished difference Result 2743 states and 3636 transitions. [2019-09-08 12:18:35,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:35,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:18:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:35,403 INFO L225 Difference]: With dead ends: 2743 [2019-09-08 12:18:35,403 INFO L226 Difference]: Without dead ends: 1637 [2019-09-08 12:18:35,406 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 12:18:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2019-09-08 12:18:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2019-09-08 12:18:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2019-09-08 12:18:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2191 transitions. [2019-09-08 12:18:35,476 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2191 transitions. Word has length 91 [2019-09-08 12:18:35,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:35,477 INFO L475 AbstractCegarLoop]: Abstraction has 1637 states and 2191 transitions. [2019-09-08 12:18:35,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2191 transitions. [2019-09-08 12:18:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:18:35,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:35,481 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] [2019-09-08 12:18:35,482 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:35,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash -920384266, now seen corresponding path program 1 times [2019-09-08 12:18:35,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:35,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:35,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:35,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:35,689 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:18:35,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:35,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:35,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:35,691 INFO L87 Difference]: Start difference. First operand 1637 states and 2191 transitions. Second operand 5 states. [2019-09-08 12:18:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:36,567 INFO L93 Difference]: Finished difference Result 1924 states and 2550 transitions. [2019-09-08 12:18:36,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:36,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 12:18:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:36,576 INFO L225 Difference]: With dead ends: 1924 [2019-09-08 12:18:36,576 INFO L226 Difference]: Without dead ends: 1126 [2019-09-08 12:18:36,579 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 12:18:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-08 12:18:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2019-09-08 12:18:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2019-09-08 12:18:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1509 transitions. [2019-09-08 12:18:36,649 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1509 transitions. Word has length 93 [2019-09-08 12:18:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:36,650 INFO L475 AbstractCegarLoop]: Abstraction has 1126 states and 1509 transitions. [2019-09-08 12:18:36,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1509 transitions. [2019-09-08 12:18:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:18:36,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:36,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:36,654 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1089233402, now seen corresponding path program 1 times [2019-09-08 12:18:36,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:36,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:36,920 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:18:36,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:36,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:36,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:36,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:36,923 INFO L87 Difference]: Start difference. First operand 1126 states and 1509 transitions. Second operand 5 states. [2019-09-08 12:18:37,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:37,635 INFO L93 Difference]: Finished difference Result 1616 states and 2174 transitions. [2019-09-08 12:18:37,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:37,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 12:18:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:37,644 INFO L225 Difference]: With dead ends: 1616 [2019-09-08 12:18:37,644 INFO L226 Difference]: Without dead ends: 1006 [2019-09-08 12:18:37,647 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 12:18:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-09-08 12:18:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2019-09-08 12:18:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-09-08 12:18:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1355 transitions. [2019-09-08 12:18:37,714 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1355 transitions. Word has length 95 [2019-09-08 12:18:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:37,716 INFO L475 AbstractCegarLoop]: Abstraction has 1006 states and 1355 transitions. [2019-09-08 12:18:37,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1355 transitions. [2019-09-08 12:18:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:18:37,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:37,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:37,722 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:37,722 INFO L82 PathProgramCache]: Analyzing trace with hash -414406108, now seen corresponding path program 1 times [2019-09-08 12:18:37,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:37,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:37,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:38,095 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:18:38,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:38,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:18:38,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:18:38,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:18:38,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:18:38,098 INFO L87 Difference]: Start difference. First operand 1006 states and 1355 transitions. Second operand 5 states. [2019-09-08 12:18:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:38,853 INFO L93 Difference]: Finished difference Result 1457 states and 1964 transitions. [2019-09-08 12:18:38,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:18:38,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:18:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:38,861 INFO L225 Difference]: With dead ends: 1457 [2019-09-08 12:18:38,861 INFO L226 Difference]: Without dead ends: 998 [2019-09-08 12:18:38,863 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 12:18:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-09-08 12:18:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2019-09-08 12:18:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:18:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1344 transitions. [2019-09-08 12:18:38,946 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1344 transitions. Word has length 97 [2019-09-08 12:18:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:38,948 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1344 transitions. [2019-09-08 12:18:38,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:18:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1344 transitions. [2019-09-08 12:18:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:18:38,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:38,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:38,953 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash -358667265, now seen corresponding path program 1 times [2019-09-08 12:18:38,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:38,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:38,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:39,372 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:18:39,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:39,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:18:39,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:18:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:18:39,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:18:39,374 INFO L87 Difference]: Start difference. First operand 998 states and 1344 transitions. Second operand 8 states. [2019-09-08 12:18:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:40,783 INFO L93 Difference]: Finished difference Result 1813 states and 2381 transitions. [2019-09-08 12:18:40,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:18:40,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-09-08 12:18:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:40,790 INFO L225 Difference]: With dead ends: 1813 [2019-09-08 12:18:40,790 INFO L226 Difference]: Without dead ends: 1361 [2019-09-08 12:18:40,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:18:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-09-08 12:18:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 998. [2019-09-08 12:18:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:18:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1343 transitions. [2019-09-08 12:18:40,864 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1343 transitions. Word has length 99 [2019-09-08 12:18:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:40,864 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1343 transitions. [2019-09-08 12:18:40,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:18:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1343 transitions. [2019-09-08 12:18:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:18:40,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:40,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:40,868 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1672611521, now seen corresponding path program 1 times [2019-09-08 12:18:40,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:40,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:40,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:41,217 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:18:41,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:41,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:41,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:41,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:41,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:41,219 INFO L87 Difference]: Start difference. First operand 998 states and 1343 transitions. Second operand 9 states. [2019-09-08 12:18:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:43,354 INFO L93 Difference]: Finished difference Result 2017 states and 2775 transitions. [2019-09-08 12:18:43,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:43,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:18:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:43,363 INFO L225 Difference]: With dead ends: 2017 [2019-09-08 12:18:43,364 INFO L226 Difference]: Without dead ends: 1840 [2019-09-08 12:18:43,365 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 12:18:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-08 12:18:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-08 12:18:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:18:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1342 transitions. [2019-09-08 12:18:43,446 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1342 transitions. Word has length 99 [2019-09-08 12:18:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:43,447 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1342 transitions. [2019-09-08 12:18:43,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1342 transitions. [2019-09-08 12:18:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:18:43,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:43,452 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:43,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1607232673, now seen corresponding path program 1 times [2019-09-08 12:18:43,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:43,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:43,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:43,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:43,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:43,828 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:18:43,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:43,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:43,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:43,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:43,830 INFO L87 Difference]: Start difference. First operand 998 states and 1342 transitions. Second operand 9 states. [2019-09-08 12:18:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:45,705 INFO L93 Difference]: Finished difference Result 1662 states and 2301 transitions. [2019-09-08 12:18:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:18:45,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:18:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:45,714 INFO L225 Difference]: With dead ends: 1662 [2019-09-08 12:18:45,714 INFO L226 Difference]: Without dead ends: 1380 [2019-09-08 12:18:45,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:18:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2019-09-08 12:18:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 998. [2019-09-08 12:18:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:18:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1341 transitions. [2019-09-08 12:18:45,815 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1341 transitions. Word has length 99 [2019-09-08 12:18:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:45,816 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1341 transitions. [2019-09-08 12:18:45,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1341 transitions. [2019-09-08 12:18:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:45,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:45,819 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:45,820 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:45,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:45,820 INFO L82 PathProgramCache]: Analyzing trace with hash -45829627, now seen corresponding path program 1 times [2019-09-08 12:18:45,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:45,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:45,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:45,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:46,199 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:18:46,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:46,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:46,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:46,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:46,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:46,201 INFO L87 Difference]: Start difference. First operand 998 states and 1341 transitions. Second operand 9 states. [2019-09-08 12:18:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:48,167 INFO L93 Difference]: Finished difference Result 1974 states and 2707 transitions. [2019-09-08 12:18:48,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:48,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:48,176 INFO L225 Difference]: With dead ends: 1974 [2019-09-08 12:18:48,177 INFO L226 Difference]: Without dead ends: 1816 [2019-09-08 12:18:48,178 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 12:18:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-09-08 12:18:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 998. [2019-09-08 12:18:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:18:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1340 transitions. [2019-09-08 12:18:48,263 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1340 transitions. Word has length 100 [2019-09-08 12:18:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:48,264 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1340 transitions. [2019-09-08 12:18:48,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1340 transitions. [2019-09-08 12:18:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:18:48,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:48,266 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:48,267 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1007680891, now seen corresponding path program 1 times [2019-09-08 12:18:48,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:48,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:48,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:48,561 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:18:48,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:48,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:48,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:48,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:48,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:48,563 INFO L87 Difference]: Start difference. First operand 998 states and 1340 transitions. Second operand 9 states. [2019-09-08 12:18:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:50,500 INFO L93 Difference]: Finished difference Result 1974 states and 2705 transitions. [2019-09-08 12:18:50,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:50,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:18:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:50,508 INFO L225 Difference]: With dead ends: 1974 [2019-09-08 12:18:50,508 INFO L226 Difference]: Without dead ends: 1816 [2019-09-08 12:18:50,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-09-08 12:18:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 998. [2019-09-08 12:18:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:18:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1339 transitions. [2019-09-08 12:18:50,593 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1339 transitions. Word has length 100 [2019-09-08 12:18:50,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:50,593 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1339 transitions. [2019-09-08 12:18:50,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1339 transitions. [2019-09-08 12:18:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:18:50,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:50,596 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] [2019-09-08 12:18:50,596 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1056417724, now seen corresponding path program 1 times [2019-09-08 12:18:50,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:50,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:50,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:50,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:50,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:50,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 12:18:50,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:50,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:50,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:50,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:50,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:50,872 INFO L87 Difference]: Start difference. First operand 998 states and 1339 transitions. Second operand 9 states. [2019-09-08 12:18:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:52,759 INFO L93 Difference]: Finished difference Result 2037 states and 2793 transitions. [2019-09-08 12:18:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:52,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:18:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:52,768 INFO L225 Difference]: With dead ends: 2037 [2019-09-08 12:18:52,768 INFO L226 Difference]: Without dead ends: 1840 [2019-09-08 12:18:52,770 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 12:18:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-08 12:18:52,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-08 12:18:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:18:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1337 transitions. [2019-09-08 12:18:52,859 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1337 transitions. Word has length 101 [2019-09-08 12:18:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:52,860 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1337 transitions. [2019-09-08 12:18:52,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1337 transitions. [2019-09-08 12:18:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:18:52,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:52,862 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] [2019-09-08 12:18:52,863 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:52,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:52,864 INFO L82 PathProgramCache]: Analyzing trace with hash -434839516, now seen corresponding path program 1 times [2019-09-08 12:18:52,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:52,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:52,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:52,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:52,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:53,148 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:18:53,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:53,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:53,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:53,151 INFO L87 Difference]: Start difference. First operand 998 states and 1337 transitions. Second operand 9 states. [2019-09-08 12:18:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:55,581 INFO L93 Difference]: Finished difference Result 2128 states and 2924 transitions. [2019-09-08 12:18:55,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:55,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:18:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:55,590 INFO L225 Difference]: With dead ends: 2128 [2019-09-08 12:18:55,590 INFO L226 Difference]: Without dead ends: 1870 [2019-09-08 12:18:55,592 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 12:18:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-09-08 12:18:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 998. [2019-09-08 12:18:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:18:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1335 transitions. [2019-09-08 12:18:55,674 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1335 transitions. Word has length 101 [2019-09-08 12:18:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:55,675 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1335 transitions. [2019-09-08 12:18:55,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1335 transitions. [2019-09-08 12:18:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:18:55,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:18:55,678 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash -674178492, now seen corresponding path program 1 times [2019-09-08 12:18:55,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:55,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:55,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:55,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:55,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:55,941 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:18:55,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:55,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:55,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:55,943 INFO L87 Difference]: Start difference. First operand 998 states and 1335 transitions. Second operand 9 states. [2019-09-08 12:18:57,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:57,905 INFO L93 Difference]: Finished difference Result 2039 states and 2794 transitions. [2019-09-08 12:18:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:18:57,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:18:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:57,912 INFO L225 Difference]: With dead ends: 2039 [2019-09-08 12:18:57,912 INFO L226 Difference]: Without dead ends: 1840 [2019-09-08 12:18:57,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:18:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-08 12:18:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-08 12:18:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:18:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1333 transitions. [2019-09-08 12:18:58,002 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1333 transitions. Word has length 101 [2019-09-08 12:18:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:18:58,002 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1333 transitions. [2019-09-08 12:18:58,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:18:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1333 transitions. [2019-09-08 12:18:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:18:58,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:18:58,006 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] [2019-09-08 12:18:58,006 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:18:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:18:58,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1611690492, now seen corresponding path program 1 times [2019-09-08 12:18:58,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:18:58,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:18:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:58,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:18:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:18:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:18:58,263 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:18:58,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:18:58,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:18:58,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:18:58,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:18:58,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:18:58,265 INFO L87 Difference]: Start difference. First operand 998 states and 1333 transitions. Second operand 9 states. [2019-09-08 12:18:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:18:59,966 INFO L93 Difference]: Finished difference Result 1811 states and 2489 transitions. [2019-09-08 12:18:59,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:18:59,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:18:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:18:59,971 INFO L225 Difference]: With dead ends: 1811 [2019-09-08 12:18:59,971 INFO L226 Difference]: Without dead ends: 1380 [2019-09-08 12:18:59,972 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 12:18:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2019-09-08 12:19:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 998. [2019-09-08 12:19:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:19:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1331 transitions. [2019-09-08 12:19:00,040 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1331 transitions. Word has length 101 [2019-09-08 12:19:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:00,040 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1331 transitions. [2019-09-08 12:19:00,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1331 transitions. [2019-09-08 12:19:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:19:00,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:00,042 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] [2019-09-08 12:19:00,043 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1392154140, now seen corresponding path program 1 times [2019-09-08 12:19:00,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:00,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:00,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:00,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:00,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:00,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 12:19:00,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:00,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:00,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:00,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:00,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:00,301 INFO L87 Difference]: Start difference. First operand 998 states and 1331 transitions. Second operand 9 states. [2019-09-08 12:19:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:02,453 INFO L93 Difference]: Finished difference Result 2017 states and 2760 transitions. [2019-09-08 12:19:02,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:02,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:19:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:02,462 INFO L225 Difference]: With dead ends: 2017 [2019-09-08 12:19:02,462 INFO L226 Difference]: Without dead ends: 1840 [2019-09-08 12:19:02,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-08 12:19:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-08 12:19:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:19:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1330 transitions. [2019-09-08 12:19:02,560 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1330 transitions. Word has length 101 [2019-09-08 12:19:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:02,561 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1330 transitions. [2019-09-08 12:19:02,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1330 transitions. [2019-09-08 12:19:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:19:02,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:02,563 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] [2019-09-08 12:19:02,564 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 277444804, now seen corresponding path program 1 times [2019-09-08 12:19:02,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:02,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:02,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:02,819 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:19:02,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:02,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:02,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:02,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:02,821 INFO L87 Difference]: Start difference. First operand 998 states and 1330 transitions. Second operand 9 states. [2019-09-08 12:19:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:05,270 INFO L93 Difference]: Finished difference Result 2090 states and 2865 transitions. [2019-09-08 12:19:05,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:05,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:19:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:05,277 INFO L225 Difference]: With dead ends: 2090 [2019-09-08 12:19:05,277 INFO L226 Difference]: Without dead ends: 1870 [2019-09-08 12:19:05,279 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 12:19:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-09-08 12:19:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 998. [2019-09-08 12:19:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:19:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1329 transitions. [2019-09-08 12:19:05,385 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1329 transitions. Word has length 101 [2019-09-08 12:19:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:05,385 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1329 transitions. [2019-09-08 12:19:05,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1329 transitions. [2019-09-08 12:19:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:19:05,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:05,387 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] [2019-09-08 12:19:05,393 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:05,394 INFO L82 PathProgramCache]: Analyzing trace with hash -807413543, now seen corresponding path program 1 times [2019-09-08 12:19:05,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:05,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:05,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:05,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:05,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:05,647 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:19:05,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:05,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:05,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:05,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:05,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:05,650 INFO L87 Difference]: Start difference. First operand 998 states and 1329 transitions. Second operand 9 states. [2019-09-08 12:19:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:07,568 INFO L93 Difference]: Finished difference Result 2012 states and 2752 transitions. [2019-09-08 12:19:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:07,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:19:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:07,573 INFO L225 Difference]: With dead ends: 2012 [2019-09-08 12:19:07,574 INFO L226 Difference]: Without dead ends: 1840 [2019-09-08 12:19:07,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-09-08 12:19:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 998. [2019-09-08 12:19:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2019-09-08 12:19:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1328 transitions. [2019-09-08 12:19:07,664 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1328 transitions. Word has length 101 [2019-09-08 12:19:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:07,665 INFO L475 AbstractCegarLoop]: Abstraction has 998 states and 1328 transitions. [2019-09-08 12:19:07,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1328 transitions. [2019-09-08 12:19:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:19:07,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:07,666 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] [2019-09-08 12:19:07,667 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1914839865, now seen corresponding path program 1 times [2019-09-08 12:19:07,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:07,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:07,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:07,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:19:07,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:07,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:07,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:07,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:07,907 INFO L87 Difference]: Start difference. First operand 998 states and 1328 transitions. Second operand 9 states. [2019-09-08 12:19:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:09,899 INFO L93 Difference]: Finished difference Result 1915 states and 2596 transitions. [2019-09-08 12:19:09,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:09,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:19:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:09,903 INFO L225 Difference]: With dead ends: 1915 [2019-09-08 12:19:09,903 INFO L226 Difference]: Without dead ends: 1766 [2019-09-08 12:19:09,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-09-08 12:19:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 997. [2019-09-08 12:19:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1326 transitions. [2019-09-08 12:19:09,988 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1326 transitions. Word has length 101 [2019-09-08 12:19:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:09,988 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1326 transitions. [2019-09-08 12:19:09,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1326 transitions. [2019-09-08 12:19:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:19:09,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:09,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:09,990 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1193894972, now seen corresponding path program 1 times [2019-09-08 12:19:09,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:09,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:09,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:10,206 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:19:10,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:10,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:10,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:10,208 INFO L87 Difference]: Start difference. First operand 997 states and 1326 transitions. Second operand 9 states. [2019-09-08 12:19:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:12,744 INFO L93 Difference]: Finished difference Result 2075 states and 2844 transitions. [2019-09-08 12:19:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:12,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:19:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:12,748 INFO L225 Difference]: With dead ends: 2075 [2019-09-08 12:19:12,748 INFO L226 Difference]: Without dead ends: 1869 [2019-09-08 12:19:12,750 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 12:19:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-08 12:19:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 997. [2019-09-08 12:19:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1325 transitions. [2019-09-08 12:19:12,875 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1325 transitions. Word has length 101 [2019-09-08 12:19:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:12,875 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1325 transitions. [2019-09-08 12:19:12,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1325 transitions. [2019-09-08 12:19:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:12,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:12,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:12,878 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1049586336, now seen corresponding path program 1 times [2019-09-08 12:19:12,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:12,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:12,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:12,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:13,126 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:19:13,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:13,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:13,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:13,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:13,128 INFO L87 Difference]: Start difference. First operand 997 states and 1325 transitions. Second operand 9 states. [2019-09-08 12:19:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:15,412 INFO L93 Difference]: Finished difference Result 1983 states and 2703 transitions. [2019-09-08 12:19:15,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:15,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:15,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:15,418 INFO L225 Difference]: With dead ends: 1983 [2019-09-08 12:19:15,418 INFO L226 Difference]: Without dead ends: 1815 [2019-09-08 12:19:15,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-08 12:19:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 997. [2019-09-08 12:19:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1323 transitions. [2019-09-08 12:19:15,564 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1323 transitions. Word has length 102 [2019-09-08 12:19:15,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:15,565 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1323 transitions. [2019-09-08 12:19:15,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1323 transitions. [2019-09-08 12:19:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:15,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:15,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:15,568 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:15,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:15,568 INFO L82 PathProgramCache]: Analyzing trace with hash -474327840, now seen corresponding path program 1 times [2019-09-08 12:19:15,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:15,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:15,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:15,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:15,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:15,885 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:19:15,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:15,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:15,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:15,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:15,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:15,887 INFO L87 Difference]: Start difference. First operand 997 states and 1323 transitions. Second operand 9 states. [2019-09-08 12:19:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:17,840 INFO L93 Difference]: Finished difference Result 1917 states and 2593 transitions. [2019-09-08 12:19:17,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:17,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:17,849 INFO L225 Difference]: With dead ends: 1917 [2019-09-08 12:19:17,849 INFO L226 Difference]: Without dead ends: 1766 [2019-09-08 12:19:17,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-09-08 12:19:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 997. [2019-09-08 12:19:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1322 transitions. [2019-09-08 12:19:18,039 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1322 transitions. Word has length 102 [2019-09-08 12:19:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:18,039 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1322 transitions. [2019-09-08 12:19:18,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1322 transitions. [2019-09-08 12:19:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:19:18,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:18,041 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:18,042 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:18,042 INFO L82 PathProgramCache]: Analyzing trace with hash 259593247, now seen corresponding path program 1 times [2019-09-08 12:19:18,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:18,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:18,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:18,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:18,294 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:19:18,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:18,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:18,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:18,296 INFO L87 Difference]: Start difference. First operand 997 states and 1322 transitions. Second operand 9 states. [2019-09-08 12:19:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:20,621 INFO L93 Difference]: Finished difference Result 1915 states and 2589 transitions. [2019-09-08 12:19:20,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:20,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:19:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:20,626 INFO L225 Difference]: With dead ends: 1915 [2019-09-08 12:19:20,626 INFO L226 Difference]: Without dead ends: 1766 [2019-09-08 12:19:20,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-09-08 12:19:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 997. [2019-09-08 12:19:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1321 transitions. [2019-09-08 12:19:20,757 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1321 transitions. Word has length 102 [2019-09-08 12:19:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:20,758 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1321 transitions. [2019-09-08 12:19:20,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1321 transitions. [2019-09-08 12:19:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:20,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:20,759 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:20,760 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:20,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1176930359, now seen corresponding path program 1 times [2019-09-08 12:19:20,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:20,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:20,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:20,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:20,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:20,998 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:19:20,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:20,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:20,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:21,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:21,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:21,001 INFO L87 Difference]: Start difference. First operand 997 states and 1321 transitions. Second operand 9 states. [2019-09-08 12:19:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:23,265 INFO L93 Difference]: Finished difference Result 2050 states and 2794 transitions. [2019-09-08 12:19:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:23,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:23,268 INFO L225 Difference]: With dead ends: 2050 [2019-09-08 12:19:23,268 INFO L226 Difference]: Without dead ends: 1839 [2019-09-08 12:19:23,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-09-08 12:19:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 997. [2019-09-08 12:19:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1319 transitions. [2019-09-08 12:19:23,366 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1319 transitions. Word has length 103 [2019-09-08 12:19:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:23,366 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1319 transitions. [2019-09-08 12:19:23,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1319 transitions. [2019-09-08 12:19:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:23,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:23,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,368 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash 870365257, now seen corresponding path program 1 times [2019-09-08 12:19:23,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:23,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:23,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:23,592 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:19:23,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:23,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:23,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:23,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:23,593 INFO L87 Difference]: Start difference. First operand 997 states and 1319 transitions. Second operand 9 states. [2019-09-08 12:19:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:25,746 INFO L93 Difference]: Finished difference Result 1989 states and 2704 transitions. [2019-09-08 12:19:25,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:25,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:25,749 INFO L225 Difference]: With dead ends: 1989 [2019-09-08 12:19:25,749 INFO L226 Difference]: Without dead ends: 1815 [2019-09-08 12:19:25,750 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 12:19:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-08 12:19:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 997. [2019-09-08 12:19:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1317 transitions. [2019-09-08 12:19:25,867 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1317 transitions. Word has length 103 [2019-09-08 12:19:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:25,868 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1317 transitions. [2019-09-08 12:19:25,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1317 transitions. [2019-09-08 12:19:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:25,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:25,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:25,870 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:25,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash -516081623, now seen corresponding path program 1 times [2019-09-08 12:19:25,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:25,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:25,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:25,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:25,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:26,088 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:19:26,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:26,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:26,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:26,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:26,090 INFO L87 Difference]: Start difference. First operand 997 states and 1317 transitions. Second operand 9 states. [2019-09-08 12:19:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:28,338 INFO L93 Difference]: Finished difference Result 1990 states and 2702 transitions. [2019-09-08 12:19:28,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:28,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:28,342 INFO L225 Difference]: With dead ends: 1990 [2019-09-08 12:19:28,342 INFO L226 Difference]: Without dead ends: 1815 [2019-09-08 12:19:28,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-08 12:19:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 997. [2019-09-08 12:19:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1315 transitions. [2019-09-08 12:19:28,480 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1315 transitions. Word has length 103 [2019-09-08 12:19:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:28,480 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1315 transitions. [2019-09-08 12:19:28,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1315 transitions. [2019-09-08 12:19:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:28,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:28,482 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:28,483 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1348564727, now seen corresponding path program 1 times [2019-09-08 12:19:28,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:28,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:28,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:28,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:28,691 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:19:28,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:28,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:28,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:28,692 INFO L87 Difference]: Start difference. First operand 997 states and 1315 transitions. Second operand 9 states. [2019-09-08 12:19:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:31,156 INFO L93 Difference]: Finished difference Result 2161 states and 2934 transitions. [2019-09-08 12:19:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:31,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:31,158 INFO L225 Difference]: With dead ends: 2161 [2019-09-08 12:19:31,158 INFO L226 Difference]: Without dead ends: 1869 [2019-09-08 12:19:31,159 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 12:19:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-08 12:19:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 997. [2019-09-08 12:19:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1313 transitions. [2019-09-08 12:19:31,288 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1313 transitions. Word has length 103 [2019-09-08 12:19:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:31,288 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1313 transitions. [2019-09-08 12:19:31,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1313 transitions. [2019-09-08 12:19:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:31,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:31,290 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:31,290 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash -673803223, now seen corresponding path program 1 times [2019-09-08 12:19:31,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:31,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:31,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:31,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:31,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:31,507 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:19:31,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:31,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:31,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:31,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:31,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:31,508 INFO L87 Difference]: Start difference. First operand 997 states and 1313 transitions. Second operand 9 states. [2019-09-08 12:19:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:33,718 INFO L93 Difference]: Finished difference Result 1984 states and 2691 transitions. [2019-09-08 12:19:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:33,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:33,721 INFO L225 Difference]: With dead ends: 1984 [2019-09-08 12:19:33,721 INFO L226 Difference]: Without dead ends: 1815 [2019-09-08 12:19:33,722 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 12:19:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-08 12:19:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 997. [2019-09-08 12:19:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-09-08 12:19:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1311 transitions. [2019-09-08 12:19:33,846 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1311 transitions. Word has length 103 [2019-09-08 12:19:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:33,847 INFO L475 AbstractCegarLoop]: Abstraction has 997 states and 1311 transitions. [2019-09-08 12:19:33,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1311 transitions. [2019-09-08 12:19:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:33,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:33,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:33,848 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1113694153, now seen corresponding path program 1 times [2019-09-08 12:19:33,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:33,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:33,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:33,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:34,066 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:19:34,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:34,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:34,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:34,067 INFO L87 Difference]: Start difference. First operand 997 states and 1311 transitions. Second operand 9 states. [2019-09-08 12:19:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:36,389 INFO L93 Difference]: Finished difference Result 1914 states and 2577 transitions. [2019-09-08 12:19:36,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:36,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:36,392 INFO L225 Difference]: With dead ends: 1914 [2019-09-08 12:19:36,393 INFO L226 Difference]: Without dead ends: 1764 [2019-09-08 12:19:36,394 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 12:19:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-09-08 12:19:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 995. [2019-09-08 12:19:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-08 12:19:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1307 transitions. [2019-09-08 12:19:36,496 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1307 transitions. Word has length 103 [2019-09-08 12:19:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:36,496 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1307 transitions. [2019-09-08 12:19:36,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1307 transitions. [2019-09-08 12:19:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:36,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:36,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:36,498 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1754695543, now seen corresponding path program 1 times [2019-09-08 12:19:36,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:36,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:36,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:36,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:36,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:36,740 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:19:36,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:36,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:36,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:36,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:36,742 INFO L87 Difference]: Start difference. First operand 995 states and 1307 transitions. Second operand 9 states. [2019-09-08 12:19:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:39,316 INFO L93 Difference]: Finished difference Result 1982 states and 2685 transitions. [2019-09-08 12:19:39,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:39,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:39,320 INFO L225 Difference]: With dead ends: 1982 [2019-09-08 12:19:39,320 INFO L226 Difference]: Without dead ends: 1813 [2019-09-08 12:19:39,321 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 12:19:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-08 12:19:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 995. [2019-09-08 12:19:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-08 12:19:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1305 transitions. [2019-09-08 12:19:39,428 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1305 transitions. Word has length 103 [2019-09-08 12:19:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:39,428 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1305 transitions. [2019-09-08 12:19:39,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1305 transitions. [2019-09-08 12:19:39,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:39,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:39,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:39,430 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:39,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1429386601, now seen corresponding path program 1 times [2019-09-08 12:19:39,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:39,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:39,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:39,622 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:19:39,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:39,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:39,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:39,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:39,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:39,624 INFO L87 Difference]: Start difference. First operand 995 states and 1305 transitions. Second operand 9 states. [2019-09-08 12:19:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:42,166 INFO L93 Difference]: Finished difference Result 1975 states and 2672 transitions. [2019-09-08 12:19:42,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:42,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:42,168 INFO L225 Difference]: With dead ends: 1975 [2019-09-08 12:19:42,168 INFO L226 Difference]: Without dead ends: 1813 [2019-09-08 12:19:42,169 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 12:19:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-08 12:19:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 995. [2019-09-08 12:19:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-08 12:19:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1304 transitions. [2019-09-08 12:19:42,273 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1304 transitions. Word has length 103 [2019-09-08 12:19:42,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:42,273 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1304 transitions. [2019-09-08 12:19:42,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1304 transitions. [2019-09-08 12:19:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:42,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:42,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:42,275 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:42,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1352247863, now seen corresponding path program 1 times [2019-09-08 12:19:42,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:42,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:42,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:42,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:42,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:42,473 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:19:42,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:42,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:42,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:42,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:42,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:42,474 INFO L87 Difference]: Start difference. First operand 995 states and 1304 transitions. Second operand 9 states. [2019-09-08 12:19:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:45,113 INFO L93 Difference]: Finished difference Result 2023 states and 2736 transitions. [2019-09-08 12:19:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:45,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:45,117 INFO L225 Difference]: With dead ends: 2023 [2019-09-08 12:19:45,117 INFO L226 Difference]: Without dead ends: 1837 [2019-09-08 12:19:45,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:19:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-09-08 12:19:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 995. [2019-09-08 12:19:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-08 12:19:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1303 transitions. [2019-09-08 12:19:45,266 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1303 transitions. Word has length 103 [2019-09-08 12:19:45,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:45,267 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1303 transitions. [2019-09-08 12:19:45,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1303 transitions. [2019-09-08 12:19:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:45,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:45,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:45,268 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:45,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1081765687, now seen corresponding path program 1 times [2019-09-08 12:19:45,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:45,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:45,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:45,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:45,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:45,546 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:19:45,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:45,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:45,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:45,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:45,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:45,548 INFO L87 Difference]: Start difference. First operand 995 states and 1303 transitions. Second operand 9 states. [2019-09-08 12:19:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:48,108 INFO L93 Difference]: Finished difference Result 1975 states and 2670 transitions. [2019-09-08 12:19:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:48,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:48,111 INFO L225 Difference]: With dead ends: 1975 [2019-09-08 12:19:48,111 INFO L226 Difference]: Without dead ends: 1813 [2019-09-08 12:19:48,112 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 12:19:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-08 12:19:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 995. [2019-09-08 12:19:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-08 12:19:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1302 transitions. [2019-09-08 12:19:48,224 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1302 transitions. Word has length 103 [2019-09-08 12:19:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:48,225 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1302 transitions. [2019-09-08 12:19:48,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1302 transitions. [2019-09-08 12:19:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:48,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:48,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:48,227 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:48,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:48,227 INFO L82 PathProgramCache]: Analyzing trace with hash 429596489, now seen corresponding path program 1 times [2019-09-08 12:19:48,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:48,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:48,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:48,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:48,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:48,410 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:19:48,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:48,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:48,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:48,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:48,411 INFO L87 Difference]: Start difference. First operand 995 states and 1302 transitions. Second operand 9 states. [2019-09-08 12:19:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:51,054 INFO L93 Difference]: Finished difference Result 1975 states and 2667 transitions. [2019-09-08 12:19:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:51,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:51,056 INFO L225 Difference]: With dead ends: 1975 [2019-09-08 12:19:51,056 INFO L226 Difference]: Without dead ends: 1813 [2019-09-08 12:19:51,057 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 12:19:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-09-08 12:19:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 995. [2019-09-08 12:19:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-09-08 12:19:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1301 transitions. [2019-09-08 12:19:51,167 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1301 transitions. Word has length 103 [2019-09-08 12:19:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:51,167 INFO L475 AbstractCegarLoop]: Abstraction has 995 states and 1301 transitions. [2019-09-08 12:19:51,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1301 transitions. [2019-09-08 12:19:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:51,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:51,169 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:51,169 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:51,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1112545982, now seen corresponding path program 1 times [2019-09-08 12:19:51,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:51,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:51,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:51,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:51,362 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:19:51,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:51,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:51,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:51,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:51,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:51,364 INFO L87 Difference]: Start difference. First operand 995 states and 1301 transitions. Second operand 9 states. [2019-09-08 12:19:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:53,766 INFO L93 Difference]: Finished difference Result 1912 states and 2567 transitions. [2019-09-08 12:19:53,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:53,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:53,768 INFO L225 Difference]: With dead ends: 1912 [2019-09-08 12:19:53,769 INFO L226 Difference]: Without dead ends: 1763 [2019-09-08 12:19:53,769 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 12:19:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-09-08 12:19:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 994. [2019-09-08 12:19:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-09-08 12:19:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1299 transitions. [2019-09-08 12:19:53,884 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1299 transitions. Word has length 103 [2019-09-08 12:19:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:53,884 INFO L475 AbstractCegarLoop]: Abstraction has 994 states and 1299 transitions. [2019-09-08 12:19:53,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1299 transitions. [2019-09-08 12:19:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:53,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:53,885 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:53,886 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:53,886 INFO L82 PathProgramCache]: Analyzing trace with hash -462834018, now seen corresponding path program 1 times [2019-09-08 12:19:53,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:53,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:53,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:54,119 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:19:54,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:54,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:19:54,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:19:54,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:19:54,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:19:54,121 INFO L87 Difference]: Start difference. First operand 994 states and 1299 transitions. Second operand 9 states. [2019-09-08 12:19:56,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:19:56,695 INFO L93 Difference]: Finished difference Result 1911 states and 2565 transitions. [2019-09-08 12:19:56,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:19:56,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:19:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:19:56,698 INFO L225 Difference]: With dead ends: 1911 [2019-09-08 12:19:56,698 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:19:56,698 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 12:19:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:19:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:19:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:19:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1297 transitions. [2019-09-08 12:19:56,816 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1297 transitions. Word has length 103 [2019-09-08 12:19:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:19:56,816 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1297 transitions. [2019-09-08 12:19:56,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:19:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1297 transitions. [2019-09-08 12:19:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:19:56,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:19:56,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:19:56,818 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:19:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:19:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash 368358430, now seen corresponding path program 1 times [2019-09-08 12:19:56,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:19:56,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:19:56,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:56,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:19:56,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:19:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:19:57,707 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:19:57,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:19:57,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:19:57,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:19:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:19:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:19:57,709 INFO L87 Difference]: Start difference. First operand 993 states and 1297 transitions. Second operand 17 states. [2019-09-08 12:19:58,329 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 12:19:58,477 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:20:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:02,631 INFO L93 Difference]: Finished difference Result 2102 states and 2821 transitions. [2019-09-08 12:20:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:20:02,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:20:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:02,635 INFO L225 Difference]: With dead ends: 2102 [2019-09-08 12:20:02,635 INFO L226 Difference]: Without dead ends: 1953 [2019-09-08 12:20:02,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:20:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-09-08 12:20:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 993. [2019-09-08 12:20:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1295 transitions. [2019-09-08 12:20:02,771 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1295 transitions. Word has length 103 [2019-09-08 12:20:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:02,772 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1295 transitions. [2019-09-08 12:20:02,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:20:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1295 transitions. [2019-09-08 12:20:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:02,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:02,774 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:02,774 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:02,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:02,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1453139291, now seen corresponding path program 1 times [2019-09-08 12:20:02,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:02,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:03,007 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:20:03,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:03,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:03,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:03,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:03,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:03,008 INFO L87 Difference]: Start difference. First operand 993 states and 1295 transitions. Second operand 9 states. [2019-09-08 12:20:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:05,344 INFO L93 Difference]: Finished difference Result 1916 states and 2567 transitions. [2019-09-08 12:20:05,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:05,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:05,346 INFO L225 Difference]: With dead ends: 1916 [2019-09-08 12:20:05,346 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:05,347 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 12:20:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1293 transitions. [2019-09-08 12:20:05,481 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1293 transitions. Word has length 104 [2019-09-08 12:20:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:05,481 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1293 transitions. [2019-09-08 12:20:05,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1293 transitions. [2019-09-08 12:20:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:05,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:05,482 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:05,483 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:05,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash -872187749, now seen corresponding path program 1 times [2019-09-08 12:20:05,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:05,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:05,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:05,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:05,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:05,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:05,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:05,783 INFO L87 Difference]: Start difference. First operand 993 states and 1293 transitions. Second operand 9 states. [2019-09-08 12:20:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:08,278 INFO L93 Difference]: Finished difference Result 1916 states and 2565 transitions. [2019-09-08 12:20:08,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:08,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:08,281 INFO L225 Difference]: With dead ends: 1916 [2019-09-08 12:20:08,281 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:08,282 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 12:20:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1291 transitions. [2019-09-08 12:20:08,426 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1291 transitions. Word has length 104 [2019-09-08 12:20:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:08,427 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1291 transitions. [2019-09-08 12:20:08,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1291 transitions. [2019-09-08 12:20:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:08,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:08,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:08,429 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:08,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1637494085, now seen corresponding path program 1 times [2019-09-08 12:20:08,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:08,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:08,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:08,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:08,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:08,639 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:20:08,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:08,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:08,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:08,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:08,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:08,640 INFO L87 Difference]: Start difference. First operand 993 states and 1291 transitions. Second operand 9 states. [2019-09-08 12:20:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:10,931 INFO L93 Difference]: Finished difference Result 1916 states and 2563 transitions. [2019-09-08 12:20:10,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:10,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:10,933 INFO L225 Difference]: With dead ends: 1916 [2019-09-08 12:20:10,933 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:10,934 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:20:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1289 transitions. [2019-09-08 12:20:11,078 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1289 transitions. Word has length 104 [2019-09-08 12:20:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:11,078 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1289 transitions. [2019-09-08 12:20:11,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1289 transitions. [2019-09-08 12:20:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:11,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:11,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:11,080 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:11,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash -18959589, now seen corresponding path program 1 times [2019-09-08 12:20:11,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:11,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:11,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:11,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:11,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:11,329 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:20:11,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:11,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:11,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:11,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:11,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:11,330 INFO L87 Difference]: Start difference. First operand 993 states and 1289 transitions. Second operand 9 states. [2019-09-08 12:20:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:13,655 INFO L93 Difference]: Finished difference Result 1916 states and 2559 transitions. [2019-09-08 12:20:13,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:13,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:13,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:13,658 INFO L225 Difference]: With dead ends: 1916 [2019-09-08 12:20:13,658 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:13,659 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 12:20:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1287 transitions. [2019-09-08 12:20:13,821 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1287 transitions. Word has length 104 [2019-09-08 12:20:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:13,821 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1287 transitions. [2019-09-08 12:20:13,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1287 transitions. [2019-09-08 12:20:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:13,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:13,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:13,823 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:13,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:13,823 INFO L82 PathProgramCache]: Analyzing trace with hash 988410427, now seen corresponding path program 1 times [2019-09-08 12:20:13,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:13,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:13,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:13,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:13,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:14,034 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:20:14,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:14,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:14,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:14,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:14,036 INFO L87 Difference]: Start difference. First operand 993 states and 1287 transitions. Second operand 9 states. [2019-09-08 12:20:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:16,525 INFO L93 Difference]: Finished difference Result 1913 states and 2554 transitions. [2019-09-08 12:20:16,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:16,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:16,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:16,527 INFO L225 Difference]: With dead ends: 1913 [2019-09-08 12:20:16,527 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:16,528 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 12:20:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1286 transitions. [2019-09-08 12:20:16,671 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1286 transitions. Word has length 104 [2019-09-08 12:20:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:16,671 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1286 transitions. [2019-09-08 12:20:16,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1286 transitions. [2019-09-08 12:20:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:16,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:16,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:16,673 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:16,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:16,673 INFO L82 PathProgramCache]: Analyzing trace with hash -803008197, now seen corresponding path program 1 times [2019-09-08 12:20:16,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:16,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:16,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:16,883 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:20:16,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:16,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:16,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:16,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:16,886 INFO L87 Difference]: Start difference. First operand 993 states and 1286 transitions. Second operand 9 states. [2019-09-08 12:20:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:19,319 INFO L93 Difference]: Finished difference Result 1913 states and 2553 transitions. [2019-09-08 12:20:19,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:19,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:19,322 INFO L225 Difference]: With dead ends: 1913 [2019-09-08 12:20:19,322 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:19,323 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 12:20:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1285 transitions. [2019-09-08 12:20:19,468 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1285 transitions. Word has length 104 [2019-09-08 12:20:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:19,468 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1285 transitions. [2019-09-08 12:20:19,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1285 transitions. [2019-09-08 12:20:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:19,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:19,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:19,471 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1451697275, now seen corresponding path program 1 times [2019-09-08 12:20:19,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:19,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:19,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:19,741 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:20:19,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:19,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:19,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:19,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:19,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:19,742 INFO L87 Difference]: Start difference. First operand 993 states and 1285 transitions. Second operand 9 states. [2019-09-08 12:20:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:22,278 INFO L93 Difference]: Finished difference Result 1968 states and 2640 transitions. [2019-09-08 12:20:22,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:22,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:22,281 INFO L225 Difference]: With dead ends: 1968 [2019-09-08 12:20:22,281 INFO L226 Difference]: Without dead ends: 1810 [2019-09-08 12:20:22,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2019-09-08 12:20:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 993. [2019-09-08 12:20:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1284 transitions. [2019-09-08 12:20:22,450 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1284 transitions. Word has length 104 [2019-09-08 12:20:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:22,450 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1284 transitions. [2019-09-08 12:20:22,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1284 transitions. [2019-09-08 12:20:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:22,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:22,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:22,452 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -369299811, now seen corresponding path program 1 times [2019-09-08 12:20:22,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:22,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:22,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:22,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:22,641 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:20:22,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:22,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:22,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:22,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:22,643 INFO L87 Difference]: Start difference. First operand 993 states and 1284 transitions. Second operand 9 states. [2019-09-08 12:20:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:25,250 INFO L93 Difference]: Finished difference Result 1911 states and 2549 transitions. [2019-09-08 12:20:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:25,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:25,252 INFO L225 Difference]: With dead ends: 1911 [2019-09-08 12:20:25,253 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:25,253 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 12:20:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1283 transitions. [2019-09-08 12:20:25,403 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1283 transitions. Word has length 104 [2019-09-08 12:20:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:25,403 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1283 transitions. [2019-09-08 12:20:25,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1283 transitions. [2019-09-08 12:20:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:25,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:25,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:25,405 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:25,405 INFO L82 PathProgramCache]: Analyzing trace with hash -339789701, now seen corresponding path program 1 times [2019-09-08 12:20:25,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:25,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:25,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:25,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:20:25,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:25,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:25,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:25,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:25,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:25,590 INFO L87 Difference]: Start difference. First operand 993 states and 1283 transitions. Second operand 9 states. [2019-09-08 12:20:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:28,150 INFO L93 Difference]: Finished difference Result 1913 states and 2550 transitions. [2019-09-08 12:20:28,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:28,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:28,152 INFO L225 Difference]: With dead ends: 1913 [2019-09-08 12:20:28,153 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:28,154 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 12:20:28,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1282 transitions. [2019-09-08 12:20:28,305 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1282 transitions. Word has length 104 [2019-09-08 12:20:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:28,305 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1282 transitions. [2019-09-08 12:20:28,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1282 transitions. [2019-09-08 12:20:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:28,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:28,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:28,307 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:28,307 INFO L82 PathProgramCache]: Analyzing trace with hash 480435067, now seen corresponding path program 1 times [2019-09-08 12:20:28,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:28,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:28,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:28,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:28,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:28,505 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:20:28,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:28,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:28,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:28,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:28,507 INFO L87 Difference]: Start difference. First operand 993 states and 1282 transitions. Second operand 9 states. [2019-09-08 12:20:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:31,059 INFO L93 Difference]: Finished difference Result 1913 states and 2549 transitions. [2019-09-08 12:20:31,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:31,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:31,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:31,061 INFO L225 Difference]: With dead ends: 1913 [2019-09-08 12:20:31,061 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:31,062 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 12:20:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1281 transitions. [2019-09-08 12:20:31,215 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1281 transitions. Word has length 104 [2019-09-08 12:20:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:31,215 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1281 transitions. [2019-09-08 12:20:31,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:31,215 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1281 transitions. [2019-09-08 12:20:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:31,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:31,217 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:31,217 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:31,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:31,217 INFO L82 PathProgramCache]: Analyzing trace with hash -696828453, now seen corresponding path program 1 times [2019-09-08 12:20:31,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:31,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:31,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:31,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:31,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:31,425 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:20:31,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:31,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:31,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:31,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:31,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:31,426 INFO L87 Difference]: Start difference. First operand 993 states and 1281 transitions. Second operand 9 states. [2019-09-08 12:20:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:33,923 INFO L93 Difference]: Finished difference Result 1913 states and 2547 transitions. [2019-09-08 12:20:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:33,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:33,925 INFO L225 Difference]: With dead ends: 1913 [2019-09-08 12:20:33,925 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 12:20:33,926 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:20:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 12:20:34,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 993. [2019-09-08 12:20:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-09-08 12:20:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1280 transitions. [2019-09-08 12:20:34,087 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1280 transitions. Word has length 104 [2019-09-08 12:20:34,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:34,087 INFO L475 AbstractCegarLoop]: Abstraction has 993 states and 1280 transitions. [2019-09-08 12:20:34,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1280 transitions. [2019-09-08 12:20:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:34,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:34,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:34,089 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:34,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:34,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1221610680, now seen corresponding path program 1 times [2019-09-08 12:20:34,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:34,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:34,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:34,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:34,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:35,491 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:20:35,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:35,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:20:35,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:20:35,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:20:35,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:20:35,493 INFO L87 Difference]: Start difference. First operand 993 states and 1280 transitions. Second operand 20 states. [2019-09-08 12:20:35,742 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-08 12:20:36,059 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-08 12:20:36,236 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-08 12:20:36,451 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:20:36,682 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-08 12:20:36,962 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-08 12:20:37,432 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 12:20:37,804 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2019-09-08 12:20:38,130 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-08 12:20:38,445 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-08 12:20:38,895 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-08 12:20:39,285 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-09-08 12:20:39,675 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-08 12:20:39,975 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 12:20:40,232 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-08 12:20:40,767 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-08 12:20:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:46,151 INFO L93 Difference]: Finished difference Result 1850 states and 2388 transitions. [2019-09-08 12:20:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:20:46,152 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-08 12:20:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:46,153 INFO L225 Difference]: With dead ends: 1850 [2019-09-08 12:20:46,153 INFO L226 Difference]: Without dead ends: 1697 [2019-09-08 12:20:46,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:20:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-09-08 12:20:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 988. [2019-09-08 12:20:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:20:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1274 transitions. [2019-09-08 12:20:46,341 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1274 transitions. Word has length 104 [2019-09-08 12:20:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:46,341 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1274 transitions. [2019-09-08 12:20:46,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:20:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1274 transitions. [2019-09-08 12:20:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:20:46,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:46,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:46,343 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1817218209, now seen corresponding path program 1 times [2019-09-08 12:20:46,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:46,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:46,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:46,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:46,544 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:20:46,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:46,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:46,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:46,546 INFO L87 Difference]: Start difference. First operand 988 states and 1274 transitions. Second operand 9 states. [2019-09-08 12:20:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:49,084 INFO L93 Difference]: Finished difference Result 1961 states and 2625 transitions. [2019-09-08 12:20:49,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:49,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:20:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:49,087 INFO L225 Difference]: With dead ends: 1961 [2019-09-08 12:20:49,087 INFO L226 Difference]: Without dead ends: 1805 [2019-09-08 12:20:49,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-08 12:20:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 988. [2019-09-08 12:20:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:20:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1273 transitions. [2019-09-08 12:20:49,262 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1273 transitions. Word has length 104 [2019-09-08 12:20:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:49,262 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1273 transitions. [2019-09-08 12:20:49,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1273 transitions. [2019-09-08 12:20:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:20:49,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:49,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:49,264 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash 796878734, now seen corresponding path program 1 times [2019-09-08 12:20:49,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:49,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:49,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:49,521 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:20:49,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:49,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:49,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:49,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:49,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:49,522 INFO L87 Difference]: Start difference. First operand 988 states and 1273 transitions. Second operand 9 states. [2019-09-08 12:20:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:51,887 INFO L93 Difference]: Finished difference Result 1915 states and 2546 transitions. [2019-09-08 12:20:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:51,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:20:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:51,890 INFO L225 Difference]: With dead ends: 1915 [2019-09-08 12:20:51,891 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:20:51,892 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 12:20:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:20:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:20:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:20:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1271 transitions. [2019-09-08 12:20:52,078 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1271 transitions. Word has length 105 [2019-09-08 12:20:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:52,078 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1271 transitions. [2019-09-08 12:20:52,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1271 transitions. [2019-09-08 12:20:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:20:52,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:52,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:52,081 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash 585181006, now seen corresponding path program 1 times [2019-09-08 12:20:52,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:52,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:52,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:52,288 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:20:52,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:52,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:52,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:52,290 INFO L87 Difference]: Start difference. First operand 988 states and 1271 transitions. Second operand 9 states. [2019-09-08 12:20:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:54,805 INFO L93 Difference]: Finished difference Result 2048 states and 2734 transitions. [2019-09-08 12:20:54,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:54,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:20:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:54,807 INFO L225 Difference]: With dead ends: 2048 [2019-09-08 12:20:54,807 INFO L226 Difference]: Without dead ends: 1829 [2019-09-08 12:20:54,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:20:54,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-09-08 12:20:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 988. [2019-09-08 12:20:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:20:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1269 transitions. [2019-09-08 12:20:54,986 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1269 transitions. Word has length 105 [2019-09-08 12:20:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:54,986 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1269 transitions. [2019-09-08 12:20:54,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1269 transitions. [2019-09-08 12:20:54,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:20:54,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:54,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:54,989 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:54,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:54,989 INFO L82 PathProgramCache]: Analyzing trace with hash 126959758, now seen corresponding path program 1 times [2019-09-08 12:20:54,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:54,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:54,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:54,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:54,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:55,180 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:20:55,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:55,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:55,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:55,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:55,181 INFO L87 Difference]: Start difference. First operand 988 states and 1269 transitions. Second operand 9 states. [2019-09-08 12:20:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:20:57,597 INFO L93 Difference]: Finished difference Result 1980 states and 2643 transitions. [2019-09-08 12:20:57,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:20:57,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:20:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:20:57,600 INFO L225 Difference]: With dead ends: 1980 [2019-09-08 12:20:57,600 INFO L226 Difference]: Without dead ends: 1805 [2019-09-08 12:20:57,601 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 12:20:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-08 12:20:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 988. [2019-09-08 12:20:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:20:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1267 transitions. [2019-09-08 12:20:57,791 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1267 transitions. Word has length 105 [2019-09-08 12:20:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:20:57,792 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1267 transitions. [2019-09-08 12:20:57,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:20:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1267 transitions. [2019-09-08 12:20:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:20:57,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:20:57,793 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:20:57,793 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:20:57,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:20:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash -705523346, now seen corresponding path program 1 times [2019-09-08 12:20:57,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:20:57,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:20:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:57,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:20:57,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:20:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:20:57,985 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:20:57,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:20:57,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:20:57,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:20:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:20:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:20:57,986 INFO L87 Difference]: Start difference. First operand 988 states and 1267 transitions. Second operand 9 states. [2019-09-08 12:21:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:00,416 INFO L93 Difference]: Finished difference Result 1915 states and 2540 transitions. [2019-09-08 12:21:00,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:00,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:00,418 INFO L225 Difference]: With dead ends: 1915 [2019-09-08 12:21:00,418 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:21:00,421 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 12:21:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:21:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:21:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1265 transitions. [2019-09-08 12:21:00,609 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1265 transitions. Word has length 105 [2019-09-08 12:21:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:00,609 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1265 transitions. [2019-09-08 12:21:00,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1265 transitions. [2019-09-08 12:21:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:00,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:00,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:00,611 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:00,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:00,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1644071758, now seen corresponding path program 1 times [2019-09-08 12:21:00,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:00,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:00,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:00,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:00,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:00,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:00,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:00,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:00,782 INFO L87 Difference]: Start difference. First operand 988 states and 1265 transitions. Second operand 9 states. [2019-09-08 12:21:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:03,213 INFO L93 Difference]: Finished difference Result 1915 states and 2538 transitions. [2019-09-08 12:21:03,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:03,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:03,216 INFO L225 Difference]: With dead ends: 1915 [2019-09-08 12:21:03,216 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:21:03,216 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 12:21:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:21:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:21:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1263 transitions. [2019-09-08 12:21:03,403 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1263 transitions. Word has length 105 [2019-09-08 12:21:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:03,403 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1263 transitions. [2019-09-08 12:21:03,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1263 transitions. [2019-09-08 12:21:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:03,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:03,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:03,405 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash -916618386, now seen corresponding path program 1 times [2019-09-08 12:21:03,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:03,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:03,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:03,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:03,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:03,628 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:21:03,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:03,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:03,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:03,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:03,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:03,629 INFO L87 Difference]: Start difference. First operand 988 states and 1263 transitions. Second operand 9 states. [2019-09-08 12:21:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:06,117 INFO L93 Difference]: Finished difference Result 1763 states and 2308 transitions. [2019-09-08 12:21:06,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:06,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:06,124 INFO L225 Difference]: With dead ends: 1763 [2019-09-08 12:21:06,124 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:21:06,125 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 12:21:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:21:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:21:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1261 transitions. [2019-09-08 12:21:06,315 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1261 transitions. Word has length 105 [2019-09-08 12:21:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:06,315 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1261 transitions. [2019-09-08 12:21:06,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1261 transitions. [2019-09-08 12:21:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:06,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:06,317 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:06,317 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1550934542, now seen corresponding path program 1 times [2019-09-08 12:21:06,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:06,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:06,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:06,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:06,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:06,489 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:21:06,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:06,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:06,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:06,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:06,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:06,490 INFO L87 Difference]: Start difference. First operand 988 states and 1261 transitions. Second operand 9 states. [2019-09-08 12:21:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:09,277 INFO L93 Difference]: Finished difference Result 1824 states and 2396 transitions. [2019-09-08 12:21:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:09,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:09,279 INFO L225 Difference]: With dead ends: 1824 [2019-09-08 12:21:09,279 INFO L226 Difference]: Without dead ends: 1805 [2019-09-08 12:21:09,279 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:21:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-08 12:21:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 988. [2019-09-08 12:21:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1259 transitions. [2019-09-08 12:21:09,475 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1259 transitions. Word has length 105 [2019-09-08 12:21:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:09,476 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1259 transitions. [2019-09-08 12:21:09,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1259 transitions. [2019-09-08 12:21:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:09,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:09,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:09,477 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:09,478 INFO L82 PathProgramCache]: Analyzing trace with hash -825223794, now seen corresponding path program 1 times [2019-09-08 12:21:09,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:09,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:09,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:09,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:09,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:09,632 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:21:09,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:09,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:09,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:09,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:09,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:09,633 INFO L87 Difference]: Start difference. First operand 988 states and 1259 transitions. Second operand 9 states. [2019-09-08 12:21:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:12,142 INFO L93 Difference]: Finished difference Result 1763 states and 2304 transitions. [2019-09-08 12:21:12,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:12,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:12,144 INFO L225 Difference]: With dead ends: 1763 [2019-09-08 12:21:12,144 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:21:12,145 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 12:21:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:21:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:21:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1257 transitions. [2019-09-08 12:21:12,350 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1257 transitions. Word has length 105 [2019-09-08 12:21:12,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:12,350 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1257 transitions. [2019-09-08 12:21:12,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1257 transitions. [2019-09-08 12:21:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:12,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:12,351 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:12,352 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:12,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:12,352 INFO L82 PathProgramCache]: Analyzing trace with hash -180694834, now seen corresponding path program 1 times [2019-09-08 12:21:12,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:12,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:12,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:12,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:12,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:12,511 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:21:12,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:12,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:12,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:12,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:12,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:12,512 INFO L87 Difference]: Start difference. First operand 988 states and 1257 transitions. Second operand 9 states. [2019-09-08 12:21:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:14,917 INFO L93 Difference]: Finished difference Result 1763 states and 2300 transitions. [2019-09-08 12:21:14,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:14,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:14,920 INFO L225 Difference]: With dead ends: 1763 [2019-09-08 12:21:14,920 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:21:14,920 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:21:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:21:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:21:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1255 transitions. [2019-09-08 12:21:15,124 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1255 transitions. Word has length 105 [2019-09-08 12:21:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:15,124 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1255 transitions. [2019-09-08 12:21:15,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1255 transitions. [2019-09-08 12:21:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:15,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:15,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] [2019-09-08 12:21:15,126 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1974492206, now seen corresponding path program 1 times [2019-09-08 12:21:15,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:15,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:15,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:15,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:15,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:15,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:15,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:15,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:15,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:15,294 INFO L87 Difference]: Start difference. First operand 988 states and 1255 transitions. Second operand 9 states. [2019-09-08 12:21:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:17,663 INFO L93 Difference]: Finished difference Result 1911 states and 2517 transitions. [2019-09-08 12:21:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:17,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:17,665 INFO L225 Difference]: With dead ends: 1911 [2019-09-08 12:21:17,665 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:21:17,666 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 12:21:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:21:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:21:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1254 transitions. [2019-09-08 12:21:17,864 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1254 transitions. Word has length 105 [2019-09-08 12:21:17,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:17,864 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1254 transitions. [2019-09-08 12:21:17,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1254 transitions. [2019-09-08 12:21:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:17,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:17,866 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:17,866 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:17,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1864649998, now seen corresponding path program 1 times [2019-09-08 12:21:17,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:17,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:17,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:17,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:17,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:18,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 12:21:18,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:18,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:18,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:18,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:18,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:18,045 INFO L87 Difference]: Start difference. First operand 988 states and 1254 transitions. Second operand 9 states. [2019-09-08 12:21:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:20,651 INFO L93 Difference]: Finished difference Result 1972 states and 2605 transitions. [2019-09-08 12:21:20,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:20,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:20,653 INFO L225 Difference]: With dead ends: 1972 [2019-09-08 12:21:20,653 INFO L226 Difference]: Without dead ends: 1805 [2019-09-08 12:21:20,654 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 12:21:20,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-09-08 12:21:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 988. [2019-09-08 12:21:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1253 transitions. [2019-09-08 12:21:20,856 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1253 transitions. Word has length 105 [2019-09-08 12:21:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:20,856 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1253 transitions. [2019-09-08 12:21:20,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1253 transitions. [2019-09-08 12:21:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:20,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:20,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:20,858 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:20,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash -69024242, now seen corresponding path program 1 times [2019-09-08 12:21:20,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:20,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:20,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:21,022 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:21:21,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:21,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:21,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:21,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:21,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:21,023 INFO L87 Difference]: Start difference. First operand 988 states and 1253 transitions. Second operand 9 states. [2019-09-08 12:21:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:23,559 INFO L93 Difference]: Finished difference Result 1911 states and 2515 transitions. [2019-09-08 12:21:23,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:23,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:23,561 INFO L225 Difference]: With dead ends: 1911 [2019-09-08 12:21:23,561 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:21:23,561 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 12:21:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:21:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:21:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1252 transitions. [2019-09-08 12:21:23,763 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1252 transitions. Word has length 105 [2019-09-08 12:21:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:23,763 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1252 transitions. [2019-09-08 12:21:23,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1252 transitions. [2019-09-08 12:21:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:23,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:23,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:23,765 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash -387747698, now seen corresponding path program 1 times [2019-09-08 12:21:23,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:23,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:23,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:23,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:23,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:23,928 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:21:23,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:23,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:23,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:23,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:23,929 INFO L87 Difference]: Start difference. First operand 988 states and 1252 transitions. Second operand 9 states. [2019-09-08 12:21:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:26,432 INFO L93 Difference]: Finished difference Result 1911 states and 2513 transitions. [2019-09-08 12:21:26,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:26,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:26,435 INFO L225 Difference]: With dead ends: 1911 [2019-09-08 12:21:26,435 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:21:26,436 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 12:21:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:21:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:21:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1251 transitions. [2019-09-08 12:21:26,643 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1251 transitions. Word has length 105 [2019-09-08 12:21:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:26,643 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1251 transitions. [2019-09-08 12:21:26,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1251 transitions. [2019-09-08 12:21:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:21:26,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:26,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:26,645 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1642130034, now seen corresponding path program 1 times [2019-09-08 12:21:26,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:26,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:26,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:26,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:26,806 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:21:26,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:26,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:21:26,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:21:26,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:21:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:21:26,808 INFO L87 Difference]: Start difference. First operand 988 states and 1251 transitions. Second operand 9 states. [2019-09-08 12:21:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:29,386 INFO L93 Difference]: Finished difference Result 1763 states and 2290 transitions. [2019-09-08 12:21:29,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:21:29,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:21:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:29,389 INFO L225 Difference]: With dead ends: 1763 [2019-09-08 12:21:29,389 INFO L226 Difference]: Without dead ends: 1757 [2019-09-08 12:21:29,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:21:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-08 12:21:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 988. [2019-09-08 12:21:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-09-08 12:21:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1250 transitions. [2019-09-08 12:21:29,599 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1250 transitions. Word has length 105 [2019-09-08 12:21:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:29,599 INFO L475 AbstractCegarLoop]: Abstraction has 988 states and 1250 transitions. [2019-09-08 12:21:29,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:21:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1250 transitions. [2019-09-08 12:21:29,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:21:29,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:29,601 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:29,601 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash -543142122, now seen corresponding path program 1 times [2019-09-08 12:21:29,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:29,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:29,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:29,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:31,421 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:21:31,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:31,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:21:31,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:21:31,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:21:31,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:21:31,422 INFO L87 Difference]: Start difference. First operand 988 states and 1250 transitions. Second operand 26 states. [2019-09-08 12:21:31,590 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 12:21:32,769 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 12:21:33,019 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-08 12:21:33,297 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-08 12:21:33,645 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-08 12:21:33,872 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:21:34,094 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:21:34,335 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:21:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:42,741 INFO L93 Difference]: Finished difference Result 1795 states and 2369 transitions. [2019-09-08 12:21:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:21:42,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2019-09-08 12:21:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:42,744 INFO L225 Difference]: With dead ends: 1795 [2019-09-08 12:21:42,744 INFO L226 Difference]: Without dead ends: 1646 [2019-09-08 12:21:42,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 12:21:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-09-08 12:21:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1009. [2019-09-08 12:21:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-09-08 12:21:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1277 transitions. [2019-09-08 12:21:42,968 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1277 transitions. Word has length 106 [2019-09-08 12:21:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:42,968 INFO L475 AbstractCegarLoop]: Abstraction has 1009 states and 1277 transitions. [2019-09-08 12:21:42,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:21:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1277 transitions. [2019-09-08 12:21:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:21:42,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:42,970 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] [2019-09-08 12:21:42,970 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash 128153622, now seen corresponding path program 1 times [2019-09-08 12:21:42,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:42,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:42,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:42,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:42,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:43,775 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:21:43,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:43,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:21:43,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:21:43,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:21:43,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:21:43,776 INFO L87 Difference]: Start difference. First operand 1009 states and 1277 transitions. Second operand 17 states. [2019-09-08 12:21:44,411 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:21:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:47,022 INFO L93 Difference]: Finished difference Result 2206 states and 2901 transitions. [2019-09-08 12:21:47,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:21:47,023 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-09-08 12:21:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:47,024 INFO L225 Difference]: With dead ends: 2206 [2019-09-08 12:21:47,025 INFO L226 Difference]: Without dead ends: 1941 [2019-09-08 12:21:47,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:21:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2019-09-08 12:21:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 957. [2019-09-08 12:21:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-09-08 12:21:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1208 transitions. [2019-09-08 12:21:47,254 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1208 transitions. Word has length 106 [2019-09-08 12:21:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:47,254 INFO L475 AbstractCegarLoop]: Abstraction has 957 states and 1208 transitions. [2019-09-08 12:21:47,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:21:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1208 transitions. [2019-09-08 12:21:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:21:47,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:47,256 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:47,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2118591338, now seen corresponding path program 1 times [2019-09-08 12:21:47,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:47,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:47,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:47,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:47,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:21:48,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:48,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:21:48,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:21:48,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:21:48,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:21:48,032 INFO L87 Difference]: Start difference. First operand 957 states and 1208 transitions. Second operand 16 states. [2019-09-08 12:21:48,725 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:21:48,878 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:21:49,029 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:21:49,212 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:21:49,374 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:21:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:53,501 INFO L93 Difference]: Finished difference Result 1642 states and 2079 transitions. [2019-09-08 12:21:53,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:21:53,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-08 12:21:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:53,503 INFO L225 Difference]: With dead ends: 1642 [2019-09-08 12:21:53,503 INFO L226 Difference]: Without dead ends: 1493 [2019-09-08 12:21:53,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:21:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-09-08 12:21:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 956. [2019-09-08 12:21:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-09-08 12:21:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1206 transitions. [2019-09-08 12:21:53,745 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1206 transitions. Word has length 106 [2019-09-08 12:21:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:53,746 INFO L475 AbstractCegarLoop]: Abstraction has 956 states and 1206 transitions. [2019-09-08 12:21:53,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:21:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1206 transitions. [2019-09-08 12:21:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:21:53,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:53,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:21:53,747 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:53,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash 715197526, now seen corresponding path program 1 times [2019-09-08 12:21:53,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:53,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:53,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:54,528 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:21:54,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:54,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:21:54,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:21:54,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:21:54,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:21:54,529 INFO L87 Difference]: Start difference. First operand 956 states and 1206 transitions. Second operand 17 states. [2019-09-08 12:21:55,118 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:21:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:21:56,622 INFO L93 Difference]: Finished difference Result 1577 states and 2058 transitions. [2019-09-08 12:21:56,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:21:56,622 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-09-08 12:21:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:21:56,624 INFO L225 Difference]: With dead ends: 1577 [2019-09-08 12:21:56,624 INFO L226 Difference]: Without dead ends: 1215 [2019-09-08 12:21:56,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:21:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-09-08 12:21:56,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 853. [2019-09-08 12:21:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-09-08 12:21:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1072 transitions. [2019-09-08 12:21:56,853 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1072 transitions. Word has length 106 [2019-09-08 12:21:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:21:56,853 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1072 transitions. [2019-09-08 12:21:56,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:21:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1072 transitions. [2019-09-08 12:21:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:21:56,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:21:56,855 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] [2019-09-08 12:21:56,855 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:21:56,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:21:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1432850954, now seen corresponding path program 1 times [2019-09-08 12:21:56,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:21:56,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:21:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:56,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:21:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:21:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:21:58,366 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:21:58,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:21:58,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:21:58,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:21:58,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:21:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:21:58,367 INFO L87 Difference]: Start difference. First operand 853 states and 1072 transitions. Second operand 25 states. [2019-09-08 12:21:58,531 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:21:59,410 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:21:59,746 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-08 12:22:00,012 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-08 12:22:00,355 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-09-08 12:22:00,601 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:22:00,811 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:22:01,015 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:22:01,195 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:22:01,396 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:22:01,638 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-08 12:22:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:07,252 INFO L93 Difference]: Finished difference Result 1677 states and 2171 transitions. [2019-09-08 12:22:07,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:22:07,252 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2019-09-08 12:22:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:07,254 INFO L225 Difference]: With dead ends: 1677 [2019-09-08 12:22:07,255 INFO L226 Difference]: Without dead ends: 1463 [2019-09-08 12:22:07,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:22:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2019-09-08 12:22:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 866. [2019-09-08 12:22:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-09-08 12:22:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1086 transitions. [2019-09-08 12:22:07,515 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1086 transitions. Word has length 106 [2019-09-08 12:22:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:07,515 INFO L475 AbstractCegarLoop]: Abstraction has 866 states and 1086 transitions. [2019-09-08 12:22:07,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:22:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1086 transitions. [2019-09-08 12:22:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:22:07,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:07,517 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] [2019-09-08 12:22:07,517 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1395534550, now seen corresponding path program 1 times [2019-09-08 12:22:07,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:07,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:07,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:08,134 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:22:08,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:08,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:22:08,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:22:08,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:22:08,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:22:08,135 INFO L87 Difference]: Start difference. First operand 866 states and 1086 transitions. Second operand 15 states. [2019-09-08 12:22:08,675 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:22:08,802 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:22:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:10,631 INFO L93 Difference]: Finished difference Result 1485 states and 1947 transitions. [2019-09-08 12:22:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:22:10,632 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2019-09-08 12:22:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:10,634 INFO L225 Difference]: With dead ends: 1485 [2019-09-08 12:22:10,634 INFO L226 Difference]: Without dead ends: 1092 [2019-09-08 12:22:10,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:22:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-09-08 12:22:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 750. [2019-09-08 12:22:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-09-08 12:22:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 941 transitions. [2019-09-08 12:22:10,842 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 941 transitions. Word has length 106 [2019-09-08 12:22:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:10,843 INFO L475 AbstractCegarLoop]: Abstraction has 750 states and 941 transitions. [2019-09-08 12:22:10,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:22:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 941 transitions. [2019-09-08 12:22:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:22:10,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:10,844 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] [2019-09-08 12:22:10,845 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:10,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:10,845 INFO L82 PathProgramCache]: Analyzing trace with hash -219637197, now seen corresponding path program 1 times [2019-09-08 12:22:10,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:10,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:10,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:10,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:10,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:11,808 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 12:22:11,956 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:22:12,104 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-08 12:22:13,480 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:22:13,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:13,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:22:13,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:22:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:22:13,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:22:13,481 INFO L87 Difference]: Start difference. First operand 750 states and 941 transitions. Second operand 31 states. [2019-09-08 12:22:13,676 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:22:14,749 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:22:14,912 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:22:15,344 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 12:22:15,634 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 12:22:15,965 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-09-08 12:22:16,365 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-09-08 12:22:16,852 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-09-08 12:22:17,136 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:22:17,405 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:22:17,710 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 12:22:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:23,785 INFO L93 Difference]: Finished difference Result 1136 states and 1460 transitions. [2019-09-08 12:22:23,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:22:23,786 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 107 [2019-09-08 12:22:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:23,787 INFO L225 Difference]: With dead ends: 1136 [2019-09-08 12:22:23,788 INFO L226 Difference]: Without dead ends: 984 [2019-09-08 12:22:23,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=475, Invalid=1975, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 12:22:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-09-08 12:22:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 761. [2019-09-08 12:22:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-08 12:22:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 957 transitions. [2019-09-08 12:22:23,998 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 957 transitions. Word has length 107 [2019-09-08 12:22:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:23,999 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 957 transitions. [2019-09-08 12:22:23,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:22:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 957 transitions. [2019-09-08 12:22:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:22:24,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:24,000 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] [2019-09-08 12:22:24,001 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:24,001 INFO L82 PathProgramCache]: Analyzing trace with hash 294360019, now seen corresponding path program 1 times [2019-09-08 12:22:24,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:24,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:24,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:24,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:24,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:24,789 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:22:24,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:24,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:22:24,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:22:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:22:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:22:24,790 INFO L87 Difference]: Start difference. First operand 761 states and 957 transitions. Second operand 17 states. [2019-09-08 12:22:25,461 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:22:25,625 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:22:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:28,373 INFO L93 Difference]: Finished difference Result 1667 states and 2215 transitions. [2019-09-08 12:22:28,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:22:28,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-08 12:22:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:28,375 INFO L225 Difference]: With dead ends: 1667 [2019-09-08 12:22:28,375 INFO L226 Difference]: Without dead ends: 1464 [2019-09-08 12:22:28,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:22:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-09-08 12:22:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 730. [2019-09-08 12:22:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-08 12:22:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 913 transitions. [2019-09-08 12:22:28,606 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 913 transitions. Word has length 107 [2019-09-08 12:22:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:28,606 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 913 transitions. [2019-09-08 12:22:28,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:22:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 913 transitions. [2019-09-08 12:22:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:22:28,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:28,608 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] [2019-09-08 12:22:28,608 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:28,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1716120548, now seen corresponding path program 1 times [2019-09-08 12:22:28,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:28,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:28,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:28,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:28,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:29,145 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:22:29,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:22:29,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:22:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:22:29,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:22:29,147 INFO L87 Difference]: Start difference. First operand 730 states and 913 transitions. Second operand 12 states. [2019-09-08 12:22:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:30,970 INFO L93 Difference]: Finished difference Result 1839 states and 2496 transitions. [2019-09-08 12:22:30,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:22:30,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2019-09-08 12:22:30,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:30,973 INFO L225 Difference]: With dead ends: 1839 [2019-09-08 12:22:30,973 INFO L226 Difference]: Without dead ends: 1669 [2019-09-08 12:22:30,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:22:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-08 12:22:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 708. [2019-09-08 12:22:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-08 12:22:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 884 transitions. [2019-09-08 12:22:31,209 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 884 transitions. Word has length 107 [2019-09-08 12:22:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:31,209 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 884 transitions. [2019-09-08 12:22:31,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:22:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 884 transitions. [2019-09-08 12:22:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:22:31,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:31,210 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] [2019-09-08 12:22:31,210 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:31,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1681056201, now seen corresponding path program 1 times [2019-09-08 12:22:31,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:31,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:31,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:31,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:31,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:31,972 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:22:31,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:31,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:22:31,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:22:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:22:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:22:31,973 INFO L87 Difference]: Start difference. First operand 708 states and 884 transitions. Second operand 16 states. [2019-09-08 12:22:32,700 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:22:32,855 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:22:33,008 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:22:33,193 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:22:33,368 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:22:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:36,132 INFO L93 Difference]: Finished difference Result 1244 states and 1582 transitions. [2019-09-08 12:22:36,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:22:36,132 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2019-09-08 12:22:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:36,133 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 12:22:36,134 INFO L226 Difference]: Without dead ends: 1095 [2019-09-08 12:22:36,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:22:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2019-09-08 12:22:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 707. [2019-09-08 12:22:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-09-08 12:22:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 882 transitions. [2019-09-08 12:22:36,361 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 882 transitions. Word has length 107 [2019-09-08 12:22:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:36,361 INFO L475 AbstractCegarLoop]: Abstraction has 707 states and 882 transitions. [2019-09-08 12:22:36,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:22:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 882 transitions. [2019-09-08 12:22:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:22:36,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:36,362 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] [2019-09-08 12:22:36,362 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1048990583, now seen corresponding path program 1 times [2019-09-08 12:22:36,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:36,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:36,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:36,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:36,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:37,131 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:22:37,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:37,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:22:37,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:22:37,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:22:37,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:22:37,133 INFO L87 Difference]: Start difference. First operand 707 states and 882 transitions. Second operand 17 states. [2019-09-08 12:22:37,908 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-08 12:22:38,079 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-08 12:22:38,234 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:22:38,431 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:22:38,623 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:22:38,912 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 12:22:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:41,132 INFO L93 Difference]: Finished difference Result 1901 states and 2567 transitions. [2019-09-08 12:22:41,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:22:41,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-08 12:22:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:41,134 INFO L225 Difference]: With dead ends: 1901 [2019-09-08 12:22:41,134 INFO L226 Difference]: Without dead ends: 1707 [2019-09-08 12:22:41,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:22:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-09-08 12:22:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 661. [2019-09-08 12:22:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-08 12:22:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 824 transitions. [2019-09-08 12:22:41,364 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 824 transitions. Word has length 107 [2019-09-08 12:22:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:41,364 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 824 transitions. [2019-09-08 12:22:41,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:22:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 824 transitions. [2019-09-08 12:22:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:22:41,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:41,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:22:41,366 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:41,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1429007226, now seen corresponding path program 1 times [2019-09-08 12:22:41,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:41,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:41,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:41,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:41,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:41,770 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:22:41,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:41,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:22:41,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:22:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:22:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:22:41,771 INFO L87 Difference]: Start difference. First operand 661 states and 824 transitions. Second operand 11 states. [2019-09-08 12:22:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:43,558 INFO L93 Difference]: Finished difference Result 1496 states and 1966 transitions. [2019-09-08 12:22:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:22:43,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 107 [2019-09-08 12:22:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:43,560 INFO L225 Difference]: With dead ends: 1496 [2019-09-08 12:22:43,560 INFO L226 Difference]: Without dead ends: 1209 [2019-09-08 12:22:43,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:22:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-09-08 12:22:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 522. [2019-09-08 12:22:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-09-08 12:22:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 654 transitions. [2019-09-08 12:22:43,753 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 654 transitions. Word has length 107 [2019-09-08 12:22:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:43,753 INFO L475 AbstractCegarLoop]: Abstraction has 522 states and 654 transitions. [2019-09-08 12:22:43,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:22:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 654 transitions. [2019-09-08 12:22:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:22:43,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:43,754 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] [2019-09-08 12:22:43,754 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash 47871049, now seen corresponding path program 1 times [2019-09-08 12:22:43,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:43,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:43,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:43,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:43,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:44,116 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:22:44,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:44,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:22:44,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:22:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:22:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:22:44,117 INFO L87 Difference]: Start difference. First operand 522 states and 654 transitions. Second operand 11 states. [2019-09-08 12:22:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:45,530 INFO L93 Difference]: Finished difference Result 1118 states and 1472 transitions. [2019-09-08 12:22:45,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:22:45,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2019-09-08 12:22:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:45,532 INFO L225 Difference]: With dead ends: 1118 [2019-09-08 12:22:45,532 INFO L226 Difference]: Without dead ends: 964 [2019-09-08 12:22:45,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:22:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-09-08 12:22:45,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 505. [2019-09-08 12:22:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-08 12:22:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 632 transitions. [2019-09-08 12:22:45,758 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 632 transitions. Word has length 108 [2019-09-08 12:22:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:45,758 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 632 transitions. [2019-09-08 12:22:45,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:22:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 632 transitions. [2019-09-08 12:22:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:22:45,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:45,759 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] [2019-09-08 12:22:45,759 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:45,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2055568258, now seen corresponding path program 1 times [2019-09-08 12:22:45,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:45,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:45,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:45,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:45,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:46,378 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:22:46,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:46,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:22:46,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:22:46,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:22:46,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:22:46,380 INFO L87 Difference]: Start difference. First operand 505 states and 632 transitions. Second operand 13 states. [2019-09-08 12:22:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:49,744 INFO L93 Difference]: Finished difference Result 2590 states and 3627 transitions. [2019-09-08 12:22:49,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:22:49,745 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-09-08 12:22:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:49,748 INFO L225 Difference]: With dead ends: 2590 [2019-09-08 12:22:49,748 INFO L226 Difference]: Without dead ends: 2415 [2019-09-08 12:22:49,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:22:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2019-09-08 12:22:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 459. [2019-09-08 12:22:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-09-08 12:22:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 571 transitions. [2019-09-08 12:22:49,994 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 571 transitions. Word has length 108 [2019-09-08 12:22:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:49,994 INFO L475 AbstractCegarLoop]: Abstraction has 459 states and 571 transitions. [2019-09-08 12:22:49,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:22:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 571 transitions. [2019-09-08 12:22:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:22:49,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:49,995 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] [2019-09-08 12:22:49,995 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:49,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1742987955, now seen corresponding path program 1 times [2019-09-08 12:22:49,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:49,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:49,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:49,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:51,231 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:22:51,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:51,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:22:51,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:22:51,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:22:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:22:51,232 INFO L87 Difference]: Start difference. First operand 459 states and 571 transitions. Second operand 21 states. [2019-09-08 12:22:52,287 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-08 12:22:52,547 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 12:22:52,735 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:22:52,910 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:22:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:54,255 INFO L93 Difference]: Finished difference Result 691 states and 883 transitions. [2019-09-08 12:22:54,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:22:54,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-08 12:22:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:54,257 INFO L225 Difference]: With dead ends: 691 [2019-09-08 12:22:54,257 INFO L226 Difference]: Without dead ends: 539 [2019-09-08 12:22:54,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:22:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-08 12:22:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 484. [2019-09-08 12:22:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-08 12:22:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 601 transitions. [2019-09-08 12:22:54,463 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 601 transitions. Word has length 108 [2019-09-08 12:22:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:54,463 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 601 transitions. [2019-09-08 12:22:54,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:22:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 601 transitions. [2019-09-08 12:22:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:22:54,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:54,464 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] [2019-09-08 12:22:54,465 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:54,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:54,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1038357806, now seen corresponding path program 1 times [2019-09-08 12:22:54,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:54,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:54,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:54,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:22:55,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:55,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:22:55,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:22:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:22:55,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:22:55,244 INFO L87 Difference]: Start difference. First operand 484 states and 601 transitions. Second operand 16 states. [2019-09-08 12:22:55,960 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:22:56,111 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:22:56,260 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:22:56,443 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:22:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:22:57,898 INFO L93 Difference]: Finished difference Result 800 states and 1002 transitions. [2019-09-08 12:22:57,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:22:57,898 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-08 12:22:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:22:57,899 INFO L225 Difference]: With dead ends: 800 [2019-09-08 12:22:57,899 INFO L226 Difference]: Without dead ends: 796 [2019-09-08 12:22:57,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:22:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-09-08 12:22:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 491. [2019-09-08 12:22:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-09-08 12:22:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 610 transitions. [2019-09-08 12:22:58,138 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 610 transitions. Word has length 108 [2019-09-08 12:22:58,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:22:58,139 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 610 transitions. [2019-09-08 12:22:58,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:22:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 610 transitions. [2019-09-08 12:22:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:22:58,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:22:58,139 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] [2019-09-08 12:22:58,140 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:22:58,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:22:58,140 INFO L82 PathProgramCache]: Analyzing trace with hash 109917810, now seen corresponding path program 1 times [2019-09-08 12:22:58,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:22:58,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:22:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:58,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:22:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:22:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:22:59,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:22:59,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:22:59,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:22:59,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:22:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:22:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:22:59,280 INFO L87 Difference]: Start difference. First operand 491 states and 610 transitions. Second operand 21 states. [2019-09-08 12:23:00,273 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:23:00,563 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-08 12:23:00,726 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:23:00,884 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:23:01,039 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 12:23:01,431 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:23:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:03,523 INFO L93 Difference]: Finished difference Result 1006 states and 1288 transitions. [2019-09-08 12:23:03,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:23:03,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-08 12:23:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:03,525 INFO L225 Difference]: With dead ends: 1006 [2019-09-08 12:23:03,525 INFO L226 Difference]: Without dead ends: 999 [2019-09-08 12:23:03,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:23:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-09-08 12:23:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 491. [2019-09-08 12:23:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-09-08 12:23:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 609 transitions. [2019-09-08 12:23:03,737 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 609 transitions. Word has length 108 [2019-09-08 12:23:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:03,737 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 609 transitions. [2019-09-08 12:23:03,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:23:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 609 transitions. [2019-09-08 12:23:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:23:03,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:03,738 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] [2019-09-08 12:23:03,738 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1668741492, now seen corresponding path program 1 times [2019-09-08 12:23:03,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:03,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:04,230 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:23:04,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:04,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:23:04,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:23:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:23:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:23:04,231 INFO L87 Difference]: Start difference. First operand 491 states and 609 transitions. Second operand 13 states. [2019-09-08 12:23:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:05,614 INFO L93 Difference]: Finished difference Result 1057 states and 1410 transitions. [2019-09-08 12:23:05,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:05,614 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-09-08 12:23:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:05,615 INFO L225 Difference]: With dead ends: 1057 [2019-09-08 12:23:05,616 INFO L226 Difference]: Without dead ends: 830 [2019-09-08 12:23:05,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:23:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2019-09-08 12:23:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 412. [2019-09-08 12:23:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 12:23:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 518 transitions. [2019-09-08 12:23:05,806 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 518 transitions. Word has length 108 [2019-09-08 12:23:05,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:05,807 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 518 transitions. [2019-09-08 12:23:05,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:23:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 518 transitions. [2019-09-08 12:23:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:23:05,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:05,807 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] [2019-09-08 12:23:05,807 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:05,808 INFO L82 PathProgramCache]: Analyzing trace with hash 881258931, now seen corresponding path program 1 times [2019-09-08 12:23:05,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:05,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:05,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:05,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:05,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:05,970 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:23:05,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:05,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:05,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:05,971 INFO L87 Difference]: Start difference. First operand 412 states and 518 transitions. Second operand 9 states. [2019-09-08 12:23:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:07,458 INFO L93 Difference]: Finished difference Result 1096 states and 1504 transitions. [2019-09-08 12:23:07,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:23:07,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-09-08 12:23:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:07,459 INFO L225 Difference]: With dead ends: 1096 [2019-09-08 12:23:07,459 INFO L226 Difference]: Without dead ends: 914 [2019-09-08 12:23:07,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:23:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-08 12:23:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 412. [2019-09-08 12:23:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 12:23:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 516 transitions. [2019-09-08 12:23:07,650 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 516 transitions. Word has length 109 [2019-09-08 12:23:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:07,650 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 516 transitions. [2019-09-08 12:23:07,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 516 transitions. [2019-09-08 12:23:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:23:07,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:07,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:23:07,651 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:07,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1509496907, now seen corresponding path program 1 times [2019-09-08 12:23:07,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:07,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:07,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:08,396 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:23:08,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:08,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:23:08,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:23:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:23:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:23:08,397 INFO L87 Difference]: Start difference. First operand 412 states and 516 transitions. Second operand 16 states. [2019-09-08 12:23:09,188 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 12:23:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:10,540 INFO L93 Difference]: Finished difference Result 978 states and 1315 transitions. [2019-09-08 12:23:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:23:10,541 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2019-09-08 12:23:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:10,542 INFO L225 Difference]: With dead ends: 978 [2019-09-08 12:23:10,542 INFO L226 Difference]: Without dead ends: 779 [2019-09-08 12:23:10,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-09-08 12:23:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-08 12:23:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 399. [2019-09-08 12:23:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-08 12:23:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 498 transitions. [2019-09-08 12:23:10,765 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 498 transitions. Word has length 109 [2019-09-08 12:23:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:10,765 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 498 transitions. [2019-09-08 12:23:10,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:23:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 498 transitions. [2019-09-08 12:23:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:23:10,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:10,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] [2019-09-08 12:23:10,766 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash 586876888, now seen corresponding path program 1 times [2019-09-08 12:23:10,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:10,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:11,176 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:23:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:23:11,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:23:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:23:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:23:11,177 INFO L87 Difference]: Start difference. First operand 399 states and 498 transitions. Second operand 12 states. [2019-09-08 12:23:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:12,830 INFO L93 Difference]: Finished difference Result 1243 states and 1666 transitions. [2019-09-08 12:23:12,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:23:12,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2019-09-08 12:23:12,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:12,832 INFO L225 Difference]: With dead ends: 1243 [2019-09-08 12:23:12,832 INFO L226 Difference]: Without dead ends: 1046 [2019-09-08 12:23:12,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:23:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-09-08 12:23:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 336. [2019-09-08 12:23:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-08 12:23:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 425 transitions. [2019-09-08 12:23:13,013 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 425 transitions. Word has length 109 [2019-09-08 12:23:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:13,013 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 425 transitions. [2019-09-08 12:23:13,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:23:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 425 transitions. [2019-09-08 12:23:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:23:13,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:13,015 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] [2019-09-08 12:23:13,015 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:13,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2070234167, now seen corresponding path program 1 times [2019-09-08 12:23:13,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:13,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:13,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:13,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:23:13,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:13,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:23:13,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:23:13,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:23:13,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:23:13,182 INFO L87 Difference]: Start difference. First operand 336 states and 425 transitions. Second operand 9 states. [2019-09-08 12:23:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:14,152 INFO L93 Difference]: Finished difference Result 532 states and 697 transitions. [2019-09-08 12:23:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:23:14,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-08 12:23:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:14,154 INFO L225 Difference]: With dead ends: 532 [2019-09-08 12:23:14,154 INFO L226 Difference]: Without dead ends: 524 [2019-09-08 12:23:14,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:23:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-08 12:23:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 336. [2019-09-08 12:23:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-08 12:23:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 424 transitions. [2019-09-08 12:23:14,332 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 424 transitions. Word has length 110 [2019-09-08 12:23:14,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:14,332 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 424 transitions. [2019-09-08 12:23:14,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:23:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 424 transitions. [2019-09-08 12:23:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:23:14,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:14,333 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] [2019-09-08 12:23:14,333 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1677363192, now seen corresponding path program 1 times [2019-09-08 12:23:14,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:14,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:14,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:16,470 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:23:16,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:16,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:23:16,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:23:16,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:23:16,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:23:16,472 INFO L87 Difference]: Start difference. First operand 336 states and 424 transitions. Second operand 31 states. [2019-09-08 12:23:16,670 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-09-08 12:23:18,169 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-08 12:23:18,429 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-09-08 12:23:18,700 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-09-08 12:23:19,014 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-09-08 12:23:19,417 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2019-09-08 12:23:19,688 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-08 12:23:19,954 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2019-09-08 12:23:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:26,111 INFO L93 Difference]: Finished difference Result 1233 states and 1695 transitions. [2019-09-08 12:23:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 12:23:26,111 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 111 [2019-09-08 12:23:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:26,113 INFO L225 Difference]: With dead ends: 1233 [2019-09-08 12:23:26,113 INFO L226 Difference]: Without dead ends: 1227 [2019-09-08 12:23:26,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2019-09-08 12:23:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-09-08 12:23:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 362. [2019-09-08 12:23:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-08 12:23:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 455 transitions. [2019-09-08 12:23:26,305 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 455 transitions. Word has length 111 [2019-09-08 12:23:26,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:26,305 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 455 transitions. [2019-09-08 12:23:26,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:23:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 455 transitions. [2019-09-08 12:23:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:23:26,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:26,306 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] [2019-09-08 12:23:26,306 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:26,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1816444114, now seen corresponding path program 1 times [2019-09-08 12:23:26,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:26,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:26,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:26,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:26,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:26,875 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-09-08 12:23:27,110 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:23:27,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:27,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:23:27,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:23:27,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:23:27,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:23:27,111 INFO L87 Difference]: Start difference. First operand 362 states and 455 transitions. Second operand 13 states. [2019-09-08 12:23:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:29,094 INFO L93 Difference]: Finished difference Result 1266 states and 1744 transitions. [2019-09-08 12:23:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:23:29,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-09-08 12:23:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:29,096 INFO L225 Difference]: With dead ends: 1266 [2019-09-08 12:23:29,096 INFO L226 Difference]: Without dead ends: 1246 [2019-09-08 12:23:29,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:23:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-09-08 12:23:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 342. [2019-09-08 12:23:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-08 12:23:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 433 transitions. [2019-09-08 12:23:29,290 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 433 transitions. Word has length 112 [2019-09-08 12:23:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:29,290 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 433 transitions. [2019-09-08 12:23:29,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:23:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 433 transitions. [2019-09-08 12:23:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:23:29,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:29,291 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] [2019-09-08 12:23:29,291 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:29,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash 613951943, now seen corresponding path program 1 times [2019-09-08 12:23:29,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:29,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:29,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:29,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:29,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:31,387 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:23:31,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:31,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:23:31,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:23:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:23:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:23:31,388 INFO L87 Difference]: Start difference. First operand 342 states and 433 transitions. Second operand 26 states. [2019-09-08 12:23:31,563 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-09-08 12:23:32,859 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-09-08 12:23:33,111 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 47 [2019-09-08 12:23:33,366 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 55 [2019-09-08 12:23:33,708 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 81 [2019-09-08 12:23:33,986 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-08 12:23:34,248 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-09-08 12:23:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:36,944 INFO L93 Difference]: Finished difference Result 700 states and 940 transitions. [2019-09-08 12:23:36,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:23:36,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 112 [2019-09-08 12:23:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:36,945 INFO L225 Difference]: With dead ends: 700 [2019-09-08 12:23:36,945 INFO L226 Difference]: Without dead ends: 694 [2019-09-08 12:23:36,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=322, Invalid=1570, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 12:23:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-08 12:23:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 343. [2019-09-08 12:23:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-08 12:23:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 434 transitions. [2019-09-08 12:23:37,138 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 434 transitions. Word has length 112 [2019-09-08 12:23:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:37,139 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 434 transitions. [2019-09-08 12:23:37,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:23:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 434 transitions. [2019-09-08 12:23:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:23:37,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:37,139 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] [2019-09-08 12:23:37,140 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:37,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash 776700875, now seen corresponding path program 1 times [2019-09-08 12:23:37,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:37,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:37,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:37,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:37,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:38,337 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:23:38,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:38,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:23:38,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:23:38,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:23:38,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:23:38,338 INFO L87 Difference]: Start difference. First operand 343 states and 434 transitions. Second operand 21 states. [2019-09-08 12:23:39,437 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:23:39,686 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-08 12:23:39,851 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:23:40,013 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:23:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:41,543 INFO L93 Difference]: Finished difference Result 689 states and 928 transitions. [2019-09-08 12:23:41,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:23:41,543 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 112 [2019-09-08 12:23:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:41,544 INFO L225 Difference]: With dead ends: 689 [2019-09-08 12:23:41,544 INFO L226 Difference]: Without dead ends: 683 [2019-09-08 12:23:41,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:23:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-08 12:23:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 344. [2019-09-08 12:23:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-08 12:23:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 435 transitions. [2019-09-08 12:23:41,749 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 435 transitions. Word has length 112 [2019-09-08 12:23:41,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:41,749 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 435 transitions. [2019-09-08 12:23:41,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:23:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 435 transitions. [2019-09-08 12:23:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:23:41,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:41,750 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] [2019-09-08 12:23:41,750 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash -237845360, now seen corresponding path program 1 times [2019-09-08 12:23:41,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:41,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:41,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:42,553 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:23:42,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:42,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:23:42,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:23:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:23:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:23:42,555 INFO L87 Difference]: Start difference. First operand 344 states and 435 transitions. Second operand 16 states. [2019-09-08 12:23:43,330 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:23:43,487 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:23:43,639 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:23:43,824 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:23:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:45,936 INFO L93 Difference]: Finished difference Result 1162 states and 1619 transitions. [2019-09-08 12:23:45,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:23:45,936 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 112 [2019-09-08 12:23:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:45,938 INFO L225 Difference]: With dead ends: 1162 [2019-09-08 12:23:45,938 INFO L226 Difference]: Without dead ends: 1156 [2019-09-08 12:23:45,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:23:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-09-08 12:23:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 316. [2019-09-08 12:23:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 12:23:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 401 transitions. [2019-09-08 12:23:46,146 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 401 transitions. Word has length 112 [2019-09-08 12:23:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:46,146 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 401 transitions. [2019-09-08 12:23:46,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:23:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 401 transitions. [2019-09-08 12:23:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:23:46,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:46,147 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] [2019-09-08 12:23:46,147 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:46,147 INFO L82 PathProgramCache]: Analyzing trace with hash -285569651, now seen corresponding path program 1 times [2019-09-08 12:23:46,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:46,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:46,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:46,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:46,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:48,663 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:23:48,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:48,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-08 12:23:48,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 12:23:48,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 12:23:48,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:23:48,665 INFO L87 Difference]: Start difference. First operand 316 states and 401 transitions. Second operand 29 states. [2019-09-08 12:23:48,916 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-08 12:23:49,234 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-09-08 12:23:49,380 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-09-08 12:23:49,568 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-08 12:23:49,749 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-09-08 12:23:49,988 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 12:23:50,489 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 12:23:50,696 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 12:23:50,946 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:23:51,262 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-08 12:23:51,622 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 12:23:52,076 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2019-09-08 12:23:52,323 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-08 12:23:52,566 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-08 12:23:52,770 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 12:23:53,120 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:23:53,533 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:23:54,913 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-09-08 12:23:55,209 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 12:23:55,558 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 12:23:57,445 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:24:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:05,888 INFO L93 Difference]: Finished difference Result 2382 states and 3323 transitions. [2019-09-08 12:24:05,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 12:24:05,888 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 112 [2019-09-08 12:24:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:05,891 INFO L225 Difference]: With dead ends: 2382 [2019-09-08 12:24:05,891 INFO L226 Difference]: Without dead ends: 2376 [2019-09-08 12:24:05,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=493, Invalid=2699, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 12:24:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-09-08 12:24:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 341. [2019-09-08 12:24:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-09-08 12:24:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 431 transitions. [2019-09-08 12:24:06,121 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 431 transitions. Word has length 112 [2019-09-08 12:24:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:06,121 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 431 transitions. [2019-09-08 12:24:06,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 12:24:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 431 transitions. [2019-09-08 12:24:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:24:06,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:06,122 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] [2019-09-08 12:24:06,122 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash -310268750, now seen corresponding path program 1 times [2019-09-08 12:24:06,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:06,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:06,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:06,759 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:24:06,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:06,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:24:06,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:24:06,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:24:06,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:24:06,760 INFO L87 Difference]: Start difference. First operand 341 states and 431 transitions. Second operand 13 states. [2019-09-08 12:24:07,276 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-08 12:24:07,414 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-09-08 12:24:07,905 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-09-08 12:24:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:09,924 INFO L93 Difference]: Finished difference Result 1467 states and 2066 transitions. [2019-09-08 12:24:09,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:24:09,925 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2019-09-08 12:24:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:09,927 INFO L225 Difference]: With dead ends: 1467 [2019-09-08 12:24:09,927 INFO L226 Difference]: Without dead ends: 1461 [2019-09-08 12:24:09,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:24:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2019-09-08 12:24:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 310. [2019-09-08 12:24:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 12:24:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 395 transitions. [2019-09-08 12:24:10,147 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 395 transitions. Word has length 113 [2019-09-08 12:24:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:10,147 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 395 transitions. [2019-09-08 12:24:10,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:24:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 395 transitions. [2019-09-08 12:24:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:24:10,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:10,148 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:10,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:10,149 INFO L82 PathProgramCache]: Analyzing trace with hash 846487170, now seen corresponding path program 1 times [2019-09-08 12:24:10,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:10,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:10,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:10,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:10,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:10,270 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:24:10,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:10,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:10,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:10,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:10,271 INFO L87 Difference]: Start difference. First operand 310 states and 395 transitions. Second operand 3 states. [2019-09-08 12:24:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:10,660 INFO L93 Difference]: Finished difference Result 598 states and 819 transitions. [2019-09-08 12:24:10,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:10,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:24:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:10,661 INFO L225 Difference]: With dead ends: 598 [2019-09-08 12:24:10,661 INFO L226 Difference]: Without dead ends: 450 [2019-09-08 12:24:10,662 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:24:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-08 12:24:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-09-08 12:24:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-08 12:24:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 596 transitions. [2019-09-08 12:24:11,011 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 596 transitions. Word has length 144 [2019-09-08 12:24:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:11,011 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 596 transitions. [2019-09-08 12:24:11,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 596 transitions. [2019-09-08 12:24:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:11,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:11,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:11,012 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1179395723, now seen corresponding path program 1 times [2019-09-08 12:24:11,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:11,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:11,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:11,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:11,156 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:24:11,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:11,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:24:11,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:24:11,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:24:11,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:24:11,157 INFO L87 Difference]: Start difference. First operand 448 states and 596 transitions. Second operand 7 states. [2019-09-08 12:24:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:12,702 INFO L93 Difference]: Finished difference Result 1336 states and 1880 transitions. [2019-09-08 12:24:12,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:24:12,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:24:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:12,704 INFO L225 Difference]: With dead ends: 1336 [2019-09-08 12:24:12,704 INFO L226 Difference]: Without dead ends: 1050 [2019-09-08 12:24:12,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:24:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2019-09-08 12:24:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 508. [2019-09-08 12:24:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-09-08 12:24:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 678 transitions. [2019-09-08 12:24:13,128 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 678 transitions. Word has length 146 [2019-09-08 12:24:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:13,128 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 678 transitions. [2019-09-08 12:24:13,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:24:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 678 transitions. [2019-09-08 12:24:13,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:13,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:13,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:13,130 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:13,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1500507275, now seen corresponding path program 1 times [2019-09-08 12:24:13,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:13,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:13,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:13,278 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:24:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:13,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:24:13,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:24:13,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:24:13,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:24:13,279 INFO L87 Difference]: Start difference. First operand 508 states and 678 transitions. Second operand 7 states. [2019-09-08 12:24:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:15,628 INFO L93 Difference]: Finished difference Result 2100 states and 2978 transitions. [2019-09-08 12:24:15,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:24:15,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:24:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:15,631 INFO L225 Difference]: With dead ends: 2100 [2019-09-08 12:24:15,631 INFO L226 Difference]: Without dead ends: 1754 [2019-09-08 12:24:15,632 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:24:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2019-09-08 12:24:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 892. [2019-09-08 12:24:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-09-08 12:24:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1236 transitions. [2019-09-08 12:24:16,463 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1236 transitions. Word has length 146 [2019-09-08 12:24:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:16,463 INFO L475 AbstractCegarLoop]: Abstraction has 892 states and 1236 transitions. [2019-09-08 12:24:16,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:24:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1236 transitions. [2019-09-08 12:24:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:16,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:16,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:16,464 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:16,465 INFO L82 PathProgramCache]: Analyzing trace with hash -656987622, now seen corresponding path program 1 times [2019-09-08 12:24:16,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:16,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:16,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:16,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:16,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:16,586 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:24:16,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:16,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:16,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:16,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:16,587 INFO L87 Difference]: Start difference. First operand 892 states and 1236 transitions. Second operand 3 states. [2019-09-08 12:24:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:17,865 INFO L93 Difference]: Finished difference Result 2004 states and 2856 transitions. [2019-09-08 12:24:17,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:17,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:24:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:17,867 INFO L225 Difference]: With dead ends: 2004 [2019-09-08 12:24:17,867 INFO L226 Difference]: Without dead ends: 1274 [2019-09-08 12:24:17,868 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:24:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-08 12:24:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-08 12:24:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-08 12:24:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1778 transitions. [2019-09-08 12:24:19,102 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1778 transitions. Word has length 146 [2019-09-08 12:24:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:19,102 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 1778 transitions. [2019-09-08 12:24:19,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1778 transitions. [2019-09-08 12:24:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:19,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:19,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:19,103 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:19,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:19,104 INFO L82 PathProgramCache]: Analyzing trace with hash -723481134, now seen corresponding path program 1 times [2019-09-08 12:24:19,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:19,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:19,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:19,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:19,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:19,209 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:24:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:19,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:19,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:19,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:19,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:19,211 INFO L87 Difference]: Start difference. First operand 1272 states and 1778 transitions. Second operand 3 states. [2019-09-08 12:24:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:21,592 INFO L93 Difference]: Finished difference Result 3380 states and 4800 transitions. [2019-09-08 12:24:21,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:21,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:24:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:21,595 INFO L225 Difference]: With dead ends: 3380 [2019-09-08 12:24:21,595 INFO L226 Difference]: Without dead ends: 2270 [2019-09-08 12:24:21,597 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:24:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-09-08 12:24:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2268. [2019-09-08 12:24:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-09-08 12:24:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3164 transitions. [2019-09-08 12:24:23,955 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3164 transitions. Word has length 146 [2019-09-08 12:24:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:23,955 INFO L475 AbstractCegarLoop]: Abstraction has 2268 states and 3164 transitions. [2019-09-08 12:24:23,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3164 transitions. [2019-09-08 12:24:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:23,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:23,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:23,957 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash 803696779, now seen corresponding path program 1 times [2019-09-08 12:24:23,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:23,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:23,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:24,106 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:24:24,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:24,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:24:24,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:24:24,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:24:24,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:24:24,107 INFO L87 Difference]: Start difference. First operand 2268 states and 3164 transitions. Second operand 7 states. [2019-09-08 12:24:33,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:33,519 INFO L93 Difference]: Finished difference Result 10196 states and 14400 transitions. [2019-09-08 12:24:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:24:33,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:24:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:33,526 INFO L225 Difference]: With dead ends: 10196 [2019-09-08 12:24:33,526 INFO L226 Difference]: Without dead ends: 8090 [2019-09-08 12:24:33,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:24:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8090 states. [2019-09-08 12:24:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8090 to 4612. [2019-09-08 12:24:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2019-09-08 12:24:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6488 transitions. [2019-09-08 12:24:38,533 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6488 transitions. Word has length 146 [2019-09-08 12:24:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:38,534 INFO L475 AbstractCegarLoop]: Abstraction has 4612 states and 6488 transitions. [2019-09-08 12:24:38,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:24:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6488 transitions. [2019-09-08 12:24:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:38,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:38,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:38,535 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:38,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1196216693, now seen corresponding path program 1 times [2019-09-08 12:24:38,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:38,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:38,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:38,682 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:24:38,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:38,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:24:38,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:24:38,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:24:38,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:24:38,683 INFO L87 Difference]: Start difference. First operand 4612 states and 6488 transitions. Second operand 7 states. [2019-09-08 12:24:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:55,673 INFO L93 Difference]: Finished difference Result 19452 states and 27492 transitions. [2019-09-08 12:24:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:24:55,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:24:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:55,689 INFO L225 Difference]: With dead ends: 19452 [2019-09-08 12:24:55,689 INFO L226 Difference]: Without dead ends: 15002 [2019-09-08 12:24:55,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:24:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15002 states. [2019-09-08 12:25:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15002 to 9540. [2019-09-08 12:25:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9540 states. [2019-09-08 12:25:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9540 states to 9540 states and 13472 transitions. [2019-09-08 12:25:06,035 INFO L78 Accepts]: Start accepts. Automaton has 9540 states and 13472 transitions. Word has length 146 [2019-09-08 12:25:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:06,035 INFO L475 AbstractCegarLoop]: Abstraction has 9540 states and 13472 transitions. [2019-09-08 12:25:06,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:25:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 9540 states and 13472 transitions. [2019-09-08 12:25:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:25:06,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:06,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:06,038 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:06,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:06,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1315067253, now seen corresponding path program 1 times [2019-09-08 12:25:06,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:06,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:06,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:06,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:06,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:25:06,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:25:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:25:06,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:25:06,249 INFO L87 Difference]: Start difference. First operand 9540 states and 13472 transitions. Second operand 7 states. [2019-09-08 12:25:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:43,966 INFO L93 Difference]: Finished difference Result 43532 states and 61716 transitions. [2019-09-08 12:25:43,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:25:43,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:25:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:44,002 INFO L225 Difference]: With dead ends: 43532 [2019-09-08 12:25:44,002 INFO L226 Difference]: Without dead ends: 34154 [2019-09-08 12:25:44,017 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:25:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34154 states. [2019-09-08 12:26:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34154 to 19876. [2019-09-08 12:26:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19876 states. [2019-09-08 12:26:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19876 states to 19876 states and 28112 transitions. [2019-09-08 12:26:04,807 INFO L78 Accepts]: Start accepts. Automaton has 19876 states and 28112 transitions. Word has length 146 [2019-09-08 12:26:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:04,808 INFO L475 AbstractCegarLoop]: Abstraction has 19876 states and 28112 transitions. [2019-09-08 12:26:04,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:26:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 19876 states and 28112 transitions. [2019-09-08 12:26:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:26:04,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:04,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:04,811 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:04,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1598265205, now seen corresponding path program 1 times [2019-09-08 12:26:04,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:04,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:04,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:04,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:04,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:05,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:05,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:26:05,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:26:05,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:26:05,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:26:05,019 INFO L87 Difference]: Start difference. First operand 19876 states and 28112 transitions. Second operand 7 states. [2019-09-08 12:27:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:07,184 INFO L93 Difference]: Finished difference Result 76948 states and 109122 transitions. [2019-09-08 12:27:07,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:27:07,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:27:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:07,245 INFO L225 Difference]: With dead ends: 76948 [2019-09-08 12:27:07,245 INFO L226 Difference]: Without dead ends: 57234 [2019-09-08 12:27:07,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:27:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57234 states. [2019-09-08 12:27:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57234 to 32676. [2019-09-08 12:27:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32676 states. [2019-09-08 12:27:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32676 states to 32676 states and 46240 transitions. [2019-09-08 12:27:43,617 INFO L78 Accepts]: Start accepts. Automaton has 32676 states and 46240 transitions. Word has length 146 [2019-09-08 12:27:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:43,618 INFO L475 AbstractCegarLoop]: Abstraction has 32676 states and 46240 transitions. [2019-09-08 12:27:43,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:27:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 32676 states and 46240 transitions. [2019-09-08 12:27:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:27:43,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:43,621 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:43,622 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash 661211626, now seen corresponding path program 1 times [2019-09-08 12:27:43,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:43,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:43,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:43,761 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:27:43,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:43,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:27:43,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:27:43,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:27:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:27:43,763 INFO L87 Difference]: Start difference. First operand 32676 states and 46240 transitions. Second operand 6 states. [2019-09-08 12:28:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:43,240 INFO L93 Difference]: Finished difference Result 54250 states and 75924 transitions. [2019-09-08 12:28:43,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:28:43,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-08 12:28:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:43,293 INFO L225 Difference]: With dead ends: 54250 [2019-09-08 12:28:43,293 INFO L226 Difference]: Without dead ends: 54248 [2019-09-08 12:28:43,304 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:28:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54248 states. [2019-09-08 12:29:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54248 to 33060. [2019-09-08 12:29:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33060 states. [2019-09-08 12:29:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33060 states to 33060 states and 46496 transitions. [2019-09-08 12:29:20,486 INFO L78 Accepts]: Start accepts. Automaton has 33060 states and 46496 transitions. Word has length 147 [2019-09-08 12:29:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:20,486 INFO L475 AbstractCegarLoop]: Abstraction has 33060 states and 46496 transitions. [2019-09-08 12:29:20,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:29:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 33060 states and 46496 transitions. [2019-09-08 12:29:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:29:20,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:20,490 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:20,490 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash -935556183, now seen corresponding path program 1 times [2019-09-08 12:29:20,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:20,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:20,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:20,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:20,627 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:29:20,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:20,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:29:20,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:29:20,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:29:20,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:20,629 INFO L87 Difference]: Start difference. First operand 33060 states and 46496 transitions. Second operand 3 states. [2019-09-08 12:30:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:17,373 INFO L93 Difference]: Finished difference Result 86984 states and 123234 transitions. [2019-09-08 12:30:17,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:30:17,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-08 12:30:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:17,431 INFO L225 Difference]: With dead ends: 86984 [2019-09-08 12:30:17,431 INFO L226 Difference]: Without dead ends: 54086 [2019-09-08 12:30:17,462 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:30:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54086 states. [2019-09-08 12:30:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54086 to 39572. [2019-09-08 12:30:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39572 states. [2019-09-08 12:30:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39572 states to 39572 states and 56072 transitions. [2019-09-08 12:30:58,976 INFO L78 Accepts]: Start accepts. Automaton has 39572 states and 56072 transitions. Word has length 147 [2019-09-08 12:30:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:58,976 INFO L475 AbstractCegarLoop]: Abstraction has 39572 states and 56072 transitions. [2019-09-08 12:30:58,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:30:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 39572 states and 56072 transitions. [2019-09-08 12:30:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 12:30:58,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:58,979 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:58,979 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash 992244541, now seen corresponding path program 1 times [2019-09-08 12:30:58,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:58,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:58,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:58,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:58,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:59,103 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:30:59,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:59,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:30:59,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:30:59,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:30:59,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:30:59,105 INFO L87 Difference]: Start difference. First operand 39572 states and 56072 transitions. Second operand 3 states.