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/eca-rers2012/Problem13_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:26:35,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:26:35,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:26:35,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:26:35,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:26:35,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:26:35,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:26:35,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:26:35,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:26:35,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:26:35,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:26:35,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:26:35,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:26:35,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:26:35,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:26:35,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:26:35,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:26:35,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:26:35,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:26:35,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:26:35,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:26:35,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:26:35,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:26:35,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:26:35,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:26:35,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:26:35,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:26:35,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:26:35,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:26:35,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:26:35,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:26:35,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:26:35,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:26:35,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:26:35,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:26:35,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:26:35,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:26:35,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:26:35,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:26:35,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:26:35,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:26:35,354 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-07 19:26:35,368 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:26:35,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:26:35,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:26:35,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:26:35,370 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:26:35,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:26:35,371 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:26:35,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:26:35,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:26:35,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:26:35,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:26:35,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:26:35,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:26:35,372 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:26:35,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:26:35,372 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:26:35,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:26:35,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:26:35,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:26:35,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:26:35,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:26:35,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:26:35,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:26:35,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:26:35,374 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:26:35,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:26:35,374 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:26:35,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:26:35,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:26:35,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:26:35,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:26:35,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:26:35,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:26:35,424 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:26:35,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label15.c [2019-09-07 19:26:35,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403716d4f/2437f6043bde4062802b981bb09b0139/FLAG9c5e879f1 [2019-09-07 19:26:36,343 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:26:36,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label15.c [2019-09-07 19:26:36,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403716d4f/2437f6043bde4062802b981bb09b0139/FLAG9c5e879f1 [2019-09-07 19:26:36,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403716d4f/2437f6043bde4062802b981bb09b0139 [2019-09-07 19:26:36,424 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:26:36,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:26:36,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:26:36,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:26:36,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:26:36,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:26:36" (1/1) ... [2019-09-07 19:26:36,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a36b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:36, skipping insertion in model container [2019-09-07 19:26:36,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:26:36" (1/1) ... [2019-09-07 19:26:36,448 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:26:36,622 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:26:38,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:26:38,475 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:26:39,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:26:39,235 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:26:39,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39 WrapperNode [2019-09-07 19:26:39,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:26:39,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:26:39,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:26:39,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:26:39,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39" (1/1) ... [2019-09-07 19:26:39,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39" (1/1) ... [2019-09-07 19:26:39,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39" (1/1) ... [2019-09-07 19:26:39,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39" (1/1) ... [2019-09-07 19:26:39,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39" (1/1) ... [2019-09-07 19:26:39,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39" (1/1) ... [2019-09-07 19:26:39,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39" (1/1) ... [2019-09-07 19:26:39,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:26:39,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:26:39,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:26:39,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:26:39,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39" (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-07 19:26:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:26:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:26:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:26:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:26:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:26:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:26:39,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:26:39,679 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:26:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:26:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:26:39,680 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:26:39,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:26:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:26:39,682 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:26:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:26:39,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:26:39,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:26:45,986 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:26:45,992 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:26:45,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:26:45 BoogieIcfgContainer [2019-09-07 19:26:45,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:26:45,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:26:45,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:26:46,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:26:46,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:26:36" (1/3) ... [2019-09-07 19:26:46,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6012cc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:26:46, skipping insertion in model container [2019-09-07 19:26:46,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:26:39" (2/3) ... [2019-09-07 19:26:46,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6012cc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:26:46, skipping insertion in model container [2019-09-07 19:26:46,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:26:45" (3/3) ... [2019-09-07 19:26:46,007 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label15.c [2019-09-07 19:26:46,018 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:26:46,030 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:26:46,049 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:26:46,106 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:26:46,106 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:26:46,107 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:26:46,107 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:26:46,107 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:26:46,107 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:26:46,107 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:26:46,107 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:26:46,107 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:26:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:26:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 19:26:46,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:46,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:26:46,164 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:46,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:46,170 INFO L82 PathProgramCache]: Analyzing trace with hash -91190537, now seen corresponding path program 1 times [2019-09-07 19:26:46,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:46,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:46,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:46,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:46,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:26:46,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:26:46,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:26:46,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:26:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:26:46,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:26:46,554 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:26:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:26:52,410 INFO L93 Difference]: Finished difference Result 3094 states and 5704 transitions. [2019-09-07 19:26:52,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:26:52,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-09-07 19:26:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:26:52,454 INFO L225 Difference]: With dead ends: 3094 [2019-09-07 19:26:52,455 INFO L226 Difference]: Without dead ends: 1913 [2019-09-07 19:26:52,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07 19:26:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-09-07 19:26:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1912. [2019-09-07 19:26:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-09-07 19:26:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 3141 transitions. [2019-09-07 19:26:52,662 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 3141 transitions. Word has length 42 [2019-09-07 19:26:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:26:52,663 INFO L475 AbstractCegarLoop]: Abstraction has 1912 states and 3141 transitions. [2019-09-07 19:26:52,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:26:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3141 transitions. [2019-09-07 19:26:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 19:26:52,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:26:52,672 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:26:52,672 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:26:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:26:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash 471977043, now seen corresponding path program 1 times [2019-09-07 19:26:52,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:26:52,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:26:52,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:52,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:26:52,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:26:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:26:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:26:52,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:26:52,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:26:52,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:26:52,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:26:52,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:26:52,949 INFO L87 Difference]: Start difference. First operand 1912 states and 3141 transitions. Second operand 5 states. [2019-09-07 19:27:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:01,690 INFO L93 Difference]: Finished difference Result 5587 states and 9298 transitions. [2019-09-07 19:27:01,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:27:01,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-07 19:27:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:01,713 INFO L225 Difference]: With dead ends: 5587 [2019-09-07 19:27:01,713 INFO L226 Difference]: Without dead ends: 3681 [2019-09-07 19:27:01,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:27:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2019-09-07 19:27:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3601. [2019-09-07 19:27:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3601 states. [2019-09-07 19:27:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5413 transitions. [2019-09-07 19:27:01,815 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5413 transitions. Word has length 117 [2019-09-07 19:27:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:01,816 INFO L475 AbstractCegarLoop]: Abstraction has 3601 states and 5413 transitions. [2019-09-07 19:27:01,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:27:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5413 transitions. [2019-09-07 19:27:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 19:27:01,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:01,819 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:27:01,820 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:01,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash 392796791, now seen corresponding path program 1 times [2019-09-07 19:27:01,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:01,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:01,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:01,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:27:01,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:27:01,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:27:01,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:27:01,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:27:01,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:27:01,953 INFO L87 Difference]: Start difference. First operand 3601 states and 5413 transitions. Second operand 5 states. [2019-09-07 19:27:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:12,025 INFO L93 Difference]: Finished difference Result 10901 states and 16894 transitions. [2019-09-07 19:27:12,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:27:12,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-09-07 19:27:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:12,065 INFO L225 Difference]: With dead ends: 10901 [2019-09-07 19:27:12,065 INFO L226 Difference]: Without dead ends: 7306 [2019-09-07 19:27:12,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:27:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-07 19:27:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7121. [2019-09-07 19:27:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7121 states. [2019-09-07 19:27:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 10497 transitions. [2019-09-07 19:27:12,257 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 10497 transitions. Word has length 131 [2019-09-07 19:27:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:12,257 INFO L475 AbstractCegarLoop]: Abstraction has 7121 states and 10497 transitions. [2019-09-07 19:27:12,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:27:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 10497 transitions. [2019-09-07 19:27:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 19:27:12,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:12,263 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:27:12,263 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:12,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:12,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1637015315, now seen corresponding path program 1 times [2019-09-07 19:27:12,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:12,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:12,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:12,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:12,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:27:12,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:27:12,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:27:12,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:27:12,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:27:12,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:27:12,435 INFO L87 Difference]: Start difference. First operand 7121 states and 10497 transitions. Second operand 6 states. [2019-09-07 19:27:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:19,879 INFO L93 Difference]: Finished difference Result 21450 states and 33775 transitions. [2019-09-07 19:27:19,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:27:19,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-09-07 19:27:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:19,990 INFO L225 Difference]: With dead ends: 21450 [2019-09-07 19:27:19,990 INFO L226 Difference]: Without dead ends: 14335 [2019-09-07 19:27:20,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:27:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14335 states. [2019-09-07 19:27:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14335 to 14126. [2019-09-07 19:27:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-09-07 19:27:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 21305 transitions. [2019-09-07 19:27:20,396 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 21305 transitions. Word has length 149 [2019-09-07 19:27:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:20,397 INFO L475 AbstractCegarLoop]: Abstraction has 14126 states and 21305 transitions. [2019-09-07 19:27:20,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:27:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 21305 transitions. [2019-09-07 19:27:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-07 19:27:20,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:20,403 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:27:20,403 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:20,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1622849155, now seen corresponding path program 1 times [2019-09-07 19:27:20,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:20,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:20,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:20,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:20,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:27:20,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:27:20,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:27:20,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:27:20,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:27:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:27:20,563 INFO L87 Difference]: Start difference. First operand 14126 states and 21305 transitions. Second operand 4 states. [2019-09-07 19:27:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:29,079 INFO L93 Difference]: Finished difference Result 41639 states and 65966 transitions. [2019-09-07 19:27:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:27:29,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-07 19:27:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:29,205 INFO L225 Difference]: With dead ends: 41639 [2019-09-07 19:27:29,206 INFO L226 Difference]: Without dead ends: 27519 [2019-09-07 19:27:29,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:27:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27519 states. [2019-09-07 19:27:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27519 to 27488. [2019-09-07 19:27:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27488 states. [2019-09-07 19:27:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27488 states to 27488 states and 40467 transitions. [2019-09-07 19:27:30,151 INFO L78 Accepts]: Start accepts. Automaton has 27488 states and 40467 transitions. Word has length 157 [2019-09-07 19:27:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:30,152 INFO L475 AbstractCegarLoop]: Abstraction has 27488 states and 40467 transitions. [2019-09-07 19:27:30,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:27:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 27488 states and 40467 transitions. [2019-09-07 19:27:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-07 19:27:30,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:30,158 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:27:30,159 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:30,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:30,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2017004392, now seen corresponding path program 1 times [2019-09-07 19:27:30,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:30,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:30,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:30,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:30,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 70 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:27:30,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:27:30,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:27:30,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:30,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:27:30,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:27:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 19:27:30,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:27:30,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:27:30,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:27:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:27:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:27:30,649 INFO L87 Difference]: Start difference. First operand 27488 states and 40467 transitions. Second operand 9 states. [2019-09-07 19:27:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:27:50,158 INFO L93 Difference]: Finished difference Result 120013 states and 210923 transitions. [2019-09-07 19:27:50,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 19:27:50,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 236 [2019-09-07 19:27:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:27:50,691 INFO L225 Difference]: With dead ends: 120013 [2019-09-07 19:27:50,691 INFO L226 Difference]: Without dead ends: 92531 [2019-09-07 19:27:50,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2019-09-07 19:27:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92531 states. [2019-09-07 19:27:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92531 to 90526. [2019-09-07 19:27:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90526 states. [2019-09-07 19:27:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90526 states to 90526 states and 134216 transitions. [2019-09-07 19:27:55,849 INFO L78 Accepts]: Start accepts. Automaton has 90526 states and 134216 transitions. Word has length 236 [2019-09-07 19:27:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:27:55,850 INFO L475 AbstractCegarLoop]: Abstraction has 90526 states and 134216 transitions. [2019-09-07 19:27:55,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:27:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 90526 states and 134216 transitions. [2019-09-07 19:27:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-07 19:27:55,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:27:55,870 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:27:55,871 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:27:55,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:27:55,871 INFO L82 PathProgramCache]: Analyzing trace with hash -973137175, now seen corresponding path program 1 times [2019-09-07 19:27:55,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:27:55,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:27:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:55,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:27:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:27:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 258 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:27:56,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:27:56,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:27:56,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:27:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:27:56,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:27:56,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:27:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 258 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:27:56,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:27:56,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:27:56,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:27:56,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:27:56,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:27:56,566 INFO L87 Difference]: Start difference. First operand 90526 states and 134216 transitions. Second operand 9 states. [2019-09-07 19:28:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:28:17,723 INFO L93 Difference]: Finished difference Result 216427 states and 371324 transitions. [2019-09-07 19:28:17,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:28:17,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-07 19:28:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:28:18,441 INFO L225 Difference]: With dead ends: 216427 [2019-09-07 19:28:18,441 INFO L226 Difference]: Without dead ends: 126710 [2019-09-07 19:28:18,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:28:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126710 states. [2019-09-07 19:28:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126710 to 126126. [2019-09-07 19:28:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126126 states. [2019-09-07 19:28:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126126 states to 126126 states and 194979 transitions. [2019-09-07 19:28:26,752 INFO L78 Accepts]: Start accepts. Automaton has 126126 states and 194979 transitions. Word has length 327 [2019-09-07 19:28:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:28:26,752 INFO L475 AbstractCegarLoop]: Abstraction has 126126 states and 194979 transitions. [2019-09-07 19:28:26,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:28:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 126126 states and 194979 transitions. [2019-09-07 19:28:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-07 19:28:26,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:26,775 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:28:26,776 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:26,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash 451824195, now seen corresponding path program 1 times [2019-09-07 19:28:26,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:26,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:26,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 200 proven. 95 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 19:28:27,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:28:27,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:28:27,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:28:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:27,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:28:27,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:28:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 348 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 19:28:27,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:28:27,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:28:27,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:28:27,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:28:27,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:28:27,241 INFO L87 Difference]: Start difference. First operand 126126 states and 194979 transitions. Second operand 9 states. [2019-09-07 19:28:47,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:28:47,698 INFO L93 Difference]: Finished difference Result 263027 states and 464885 transitions. [2019-09-07 19:28:47,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 19:28:47,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 335 [2019-09-07 19:28:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:28:48,672 INFO L225 Difference]: With dead ends: 263027 [2019-09-07 19:28:48,673 INFO L226 Difference]: Without dead ends: 137710 [2019-09-07 19:28:48,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 19:28:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137710 states. [2019-09-07 19:28:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137710 to 135479. [2019-09-07 19:28:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135479 states. [2019-09-07 19:28:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135479 states to 135479 states and 191964 transitions. [2019-09-07 19:28:56,707 INFO L78 Accepts]: Start accepts. Automaton has 135479 states and 191964 transitions. Word has length 335 [2019-09-07 19:28:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:28:56,707 INFO L475 AbstractCegarLoop]: Abstraction has 135479 states and 191964 transitions. [2019-09-07 19:28:56,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:28:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 135479 states and 191964 transitions. [2019-09-07 19:28:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-07 19:28:56,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:28:56,731 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:28:56,731 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:28:56,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:28:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1138445871, now seen corresponding path program 1 times [2019-09-07 19:28:56,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:28:56,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:28:56,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:56,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:56,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:28:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 104 proven. 198 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-07 19:28:57,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:28:57,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:28:57,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:28:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:28:57,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:28:57,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:28:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-07 19:28:57,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:28:57,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-07 19:28:57,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:28:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:28:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:28:57,301 INFO L87 Difference]: Start difference. First operand 135479 states and 191964 transitions. Second operand 13 states. [2019-09-07 19:30:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:30:20,462 INFO L93 Difference]: Finished difference Result 422762 states and 644758 transitions. [2019-09-07 19:30:20,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-07 19:30:20,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 342 [2019-09-07 19:30:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:30:21,436 INFO L225 Difference]: With dead ends: 422762 [2019-09-07 19:30:21,437 INFO L226 Difference]: Without dead ends: 288092 [2019-09-07 19:30:21,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 414 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3863 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1299, Invalid=9003, Unknown=0, NotChecked=0, Total=10302 [2019-09-07 19:30:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288092 states. [2019-09-07 19:30:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288092 to 257398. [2019-09-07 19:30:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257398 states. [2019-09-07 19:30:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257398 states to 257398 states and 333049 transitions. [2019-09-07 19:30:31,465 INFO L78 Accepts]: Start accepts. Automaton has 257398 states and 333049 transitions. Word has length 342 [2019-09-07 19:30:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:30:31,467 INFO L475 AbstractCegarLoop]: Abstraction has 257398 states and 333049 transitions. [2019-09-07 19:30:31,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:30:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 257398 states and 333049 transitions. [2019-09-07 19:30:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-09-07 19:30:31,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:30:31,630 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:30:31,630 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:30:31,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:30:31,630 INFO L82 PathProgramCache]: Analyzing trace with hash 677196648, now seen corresponding path program 1 times [2019-09-07 19:30:31,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:30:31,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:30:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:31,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:31,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 435 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 19:30:32,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:30:32,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:30:32,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:30:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:32,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:30:32,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:30:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 435 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 19:30:32,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:30:32,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:30:32,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:30:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:30:32,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:30:32,807 INFO L87 Difference]: Start difference. First operand 257398 states and 333049 transitions. Second operand 9 states. [2019-09-07 19:30:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:30:45,092 INFO L93 Difference]: Finished difference Result 488379 states and 659183 transitions. [2019-09-07 19:30:45,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:30:45,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 641 [2019-09-07 19:30:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:30:45,942 INFO L225 Difference]: With dead ends: 488379 [2019-09-07 19:30:45,942 INFO L226 Difference]: Without dead ends: 254626 [2019-09-07 19:30:46,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-09-07 19:30:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254626 states. [2019-09-07 19:30:55,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254626 to 218401. [2019-09-07 19:30:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218401 states. [2019-09-07 19:30:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218401 states to 218401 states and 279354 transitions. [2019-09-07 19:30:56,380 INFO L78 Accepts]: Start accepts. Automaton has 218401 states and 279354 transitions. Word has length 641 [2019-09-07 19:30:56,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:30:56,381 INFO L475 AbstractCegarLoop]: Abstraction has 218401 states and 279354 transitions. [2019-09-07 19:30:56,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:30:56,381 INFO L276 IsEmpty]: Start isEmpty. Operand 218401 states and 279354 transitions. [2019-09-07 19:30:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2019-09-07 19:30:56,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:30:56,597 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:30:56,597 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:30:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:30:56,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1237954198, now seen corresponding path program 1 times [2019-09-07 19:30:56,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:30:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:30:56,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:56,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:56,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:30:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 356 proven. 249 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-07 19:30:58,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:30:58,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:30:58,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:30:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:30:58,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:30:58,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:31:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 600 proven. 2 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-07 19:31:02,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:31:02,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:31:02,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:31:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:31:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:31:02,030 INFO L87 Difference]: Start difference. First operand 218401 states and 279354 transitions. Second operand 9 states. [2019-09-07 19:31:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:26,345 INFO L93 Difference]: Finished difference Result 533508 states and 709797 transitions. [2019-09-07 19:31:26,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 19:31:26,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 783 [2019-09-07 19:31:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:27,249 INFO L225 Difference]: With dead ends: 533508 [2019-09-07 19:31:27,249 INFO L226 Difference]: Without dead ends: 310115 [2019-09-07 19:31:27,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=1320, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 19:31:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310115 states. [2019-09-07 19:31:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310115 to 290962. [2019-09-07 19:31:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290962 states. [2019-09-07 19:31:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290962 states to 290962 states and 339533 transitions. [2019-09-07 19:31:34,555 INFO L78 Accepts]: Start accepts. Automaton has 290962 states and 339533 transitions. Word has length 783 [2019-09-07 19:31:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:34,557 INFO L475 AbstractCegarLoop]: Abstraction has 290962 states and 339533 transitions. [2019-09-07 19:31:34,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:31:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 290962 states and 339533 transitions. [2019-09-07 19:31:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2019-09-07 19:31:34,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:34,788 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:31:34,788 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash -529535497, now seen corresponding path program 1 times [2019-09-07 19:31:34,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:34,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:34,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:34,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:34,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 200 proven. 133 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 19:31:39,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:31:39,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:31:39,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:31:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:40,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:31:40,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:31:40,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:31:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-09-07 19:31:40,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:31:40,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:31:40,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:31:40,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:31:40,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:31:40,651 INFO L87 Difference]: Start difference. First operand 290962 states and 339533 transitions. Second operand 9 states. [2019-09-07 19:32:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:32:00,201 INFO L93 Difference]: Finished difference Result 660679 states and 755482 transitions. [2019-09-07 19:32:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 19:32:00,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 907 [2019-09-07 19:32:00,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:32:00,939 INFO L225 Difference]: With dead ends: 660679 [2019-09-07 19:32:00,939 INFO L226 Difference]: Without dead ends: 374568 [2019-09-07 19:32:01,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 919 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-09-07 19:32:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374568 states. [2019-09-07 19:32:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374568 to 351851. [2019-09-07 19:32:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351851 states. [2019-09-07 19:32:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351851 states to 351851 states and 392331 transitions. [2019-09-07 19:32:10,603 INFO L78 Accepts]: Start accepts. Automaton has 351851 states and 392331 transitions. Word has length 907 [2019-09-07 19:32:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:32:10,604 INFO L475 AbstractCegarLoop]: Abstraction has 351851 states and 392331 transitions. [2019-09-07 19:32:10,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:32:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 351851 states and 392331 transitions. [2019-09-07 19:32:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1020 [2019-09-07 19:32:10,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:32:10,767 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:32:10,767 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:32:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:32:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2055900312, now seen corresponding path program 1 times [2019-09-07 19:32:10,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:32:10,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:32:10,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:10,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:10,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 507 proven. 247 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-09-07 19:32:16,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:32:16,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:32:16,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:16,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1426 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:32:16,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:32:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 527 proven. 2 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-09-07 19:32:17,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:32:17,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 19:32:17,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:32:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:32:17,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:32:17,616 INFO L87 Difference]: Start difference. First operand 351851 states and 392331 transitions. Second operand 11 states. [2019-09-07 19:32:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:32:37,325 INFO L93 Difference]: Finished difference Result 718053 states and 800446 transitions. [2019-09-07 19:32:37,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 19:32:37,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1019 [2019-09-07 19:32:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:32:38,196 INFO L225 Difference]: With dead ends: 718053 [2019-09-07 19:32:38,197 INFO L226 Difference]: Without dead ends: 366981 [2019-09-07 19:32:38,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1052 GetRequests, 1032 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:32:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366981 states. [2019-09-07 19:32:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366981 to 359710. [2019-09-07 19:32:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359710 states. [2019-09-07 19:32:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359710 states to 359710 states and 396380 transitions. [2019-09-07 19:32:44,208 INFO L78 Accepts]: Start accepts. Automaton has 359710 states and 396380 transitions. Word has length 1019 [2019-09-07 19:32:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:32:44,209 INFO L475 AbstractCegarLoop]: Abstraction has 359710 states and 396380 transitions. [2019-09-07 19:32:44,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:32:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 359710 states and 396380 transitions. [2019-09-07 19:32:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2019-09-07 19:32:44,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:32:44,368 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:32:44,369 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:32:44,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:32:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash -226589335, now seen corresponding path program 1 times [2019-09-07 19:32:44,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:32:44,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:32:44,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:44,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:44,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 264 proven. 234 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-07 19:32:46,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:32:46,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:32:46,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:47,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:32:47,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:32:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 19:32:48,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:32:48,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 19:32:48,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:32:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:32:48,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:32:48,885 INFO L87 Difference]: Start difference. First operand 359710 states and 396380 transitions. Second operand 8 states. [2019-09-07 19:33:14,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:33:14,667 INFO L93 Difference]: Finished difference Result 747258 states and 826435 transitions. [2019-09-07 19:33:14,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 19:33:14,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1067 [2019-09-07 19:33:14,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:33:15,786 INFO L225 Difference]: With dead ends: 747258 [2019-09-07 19:33:15,786 INFO L226 Difference]: Without dead ends: 403526 [2019-09-07 19:33:16,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1096 GetRequests, 1078 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:33:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403526 states. [2019-09-07 19:33:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403526 to 383421. [2019-09-07 19:33:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383421 states. [2019-09-07 19:33:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383421 states to 383421 states and 418181 transitions. [2019-09-07 19:33:26,184 INFO L78 Accepts]: Start accepts. Automaton has 383421 states and 418181 transitions. Word has length 1067 [2019-09-07 19:33:26,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:33:26,184 INFO L475 AbstractCegarLoop]: Abstraction has 383421 states and 418181 transitions. [2019-09-07 19:33:26,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:33:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 383421 states and 418181 transitions. [2019-09-07 19:33:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2019-09-07 19:33:26,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:33:26,345 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:33:26,345 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:33:26,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:33:26,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1322841317, now seen corresponding path program 1 times [2019-09-07 19:33:26,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:33:26,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:33:26,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:26,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:26,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 585 proven. 2 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2019-09-07 19:33:29,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:33:29,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:33:29,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:29,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:33:29,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:33:29,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:33:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1095 backedges. 698 proven. 2 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2019-09-07 19:33:34,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:33:34,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 19:33:34,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:33:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:33:34,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:33:34,355 INFO L87 Difference]: Start difference. First operand 383421 states and 418181 transitions. Second operand 11 states. [2019-09-07 19:34:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:34:17,728 INFO L93 Difference]: Finished difference Result 866638 states and 949516 transitions. [2019-09-07 19:34:17,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-07 19:34:17,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1084 [2019-09-07 19:34:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:34:18,851 INFO L225 Difference]: With dead ends: 866638 [2019-09-07 19:34:18,851 INFO L226 Difference]: Without dead ends: 489574 [2019-09-07 19:34:19,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1263 GetRequests, 1165 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3847 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1287, Invalid=8613, Unknown=0, NotChecked=0, Total=9900 [2019-09-07 19:34:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489574 states. [2019-09-07 19:34:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489574 to 473300. [2019-09-07 19:34:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473300 states. [2019-09-07 19:34:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473300 states to 473300 states and 511837 transitions. [2019-09-07 19:34:27,794 INFO L78 Accepts]: Start accepts. Automaton has 473300 states and 511837 transitions. Word has length 1084 [2019-09-07 19:34:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:34:27,795 INFO L475 AbstractCegarLoop]: Abstraction has 473300 states and 511837 transitions. [2019-09-07 19:34:27,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:34:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 473300 states and 511837 transitions. [2019-09-07 19:34:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2019-09-07 19:34:27,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:34:27,911 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:34:27,911 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:34:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:34:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1623328829, now seen corresponding path program 1 times [2019-09-07 19:34:27,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:34:27,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:34:27,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:27,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 254 proven. 650 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-07 19:34:35,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:34:35,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:34:35,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:35,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:34:35,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:34:35,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:34:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 806 proven. 2 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2019-09-07 19:34:36,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:34:36,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:34:36,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:34:36,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:34:36,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:34:36,460 INFO L87 Difference]: Start difference. First operand 473300 states and 511837 transitions. Second operand 16 states. [2019-09-07 19:35:03,056 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-09-07 19:35:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:35:19,073 INFO L93 Difference]: Finished difference Result 856074 states and 926264 transitions. [2019-09-07 19:35:19,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-07 19:35:19,074 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1113 [2019-09-07 19:35:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:35:20,854 INFO L225 Difference]: With dead ends: 856074 [2019-09-07 19:35:20,854 INFO L226 Difference]: Without dead ends: 524819 [2019-09-07 19:35:21,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1302 GetRequests, 1192 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4691 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1752, Invalid=10458, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 19:35:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524819 states. [2019-09-07 19:35:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524819 to 510738. [2019-09-07 19:35:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510738 states. [2019-09-07 19:35:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510738 states to 510738 states and 549210 transitions. [2019-09-07 19:35:34,107 INFO L78 Accepts]: Start accepts. Automaton has 510738 states and 549210 transitions. Word has length 1113 [2019-09-07 19:35:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:35:34,107 INFO L475 AbstractCegarLoop]: Abstraction has 510738 states and 549210 transitions. [2019-09-07 19:35:34,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:35:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 510738 states and 549210 transitions. [2019-09-07 19:35:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1168 [2019-09-07 19:35:34,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:35:34,170 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:35:34,170 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:35:34,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:35:34,171 INFO L82 PathProgramCache]: Analyzing trace with hash 660059293, now seen corresponding path program 1 times [2019-09-07 19:35:34,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:35:34,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:35:34,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:34,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:34,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2019-09-07 19:35:41,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:35:41,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:35:41,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:41,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 19:35:41,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:35:41,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:35:41,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:35:41,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 19:35:41,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 19:35:41,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 19:35:41,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 19:35:41,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 19:35:41,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 19:35:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 599 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-07 19:35:44,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:35:44,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-09-07 19:35:44,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:35:44,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:35:44,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:35:44,880 INFO L87 Difference]: Start difference. First operand 510738 states and 549210 transitions. Second operand 16 states. [2019-09-07 19:36:41,331 WARN L188 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-07 19:36:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:49,522 INFO L93 Difference]: Finished difference Result 1306609 states and 1450127 transitions. [2019-09-07 19:36:49,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-09-07 19:36:49,523 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1167 [2019-09-07 19:36:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:53,034 INFO L225 Difference]: With dead ends: 1306609 [2019-09-07 19:36:53,035 INFO L226 Difference]: Without dead ends: 807857 [2019-09-07 19:36:53,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1294 GetRequests, 1170 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5906 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2415, Invalid=13335, Unknown=0, NotChecked=0, Total=15750 [2019-09-07 19:36:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807857 states. [2019-09-07 19:37:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807857 to 780104. [2019-09-07 19:37:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780104 states. [2019-09-07 19:37:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780104 states to 780104 states and 853703 transitions. [2019-09-07 19:37:18,806 INFO L78 Accepts]: Start accepts. Automaton has 780104 states and 853703 transitions. Word has length 1167 [2019-09-07 19:37:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:18,807 INFO L475 AbstractCegarLoop]: Abstraction has 780104 states and 853703 transitions. [2019-09-07 19:37:18,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:37:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 780104 states and 853703 transitions. [2019-09-07 19:37:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1379 [2019-09-07 19:37:20,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:20,416 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:20,416 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:20,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1063730158, now seen corresponding path program 1 times [2019-09-07 19:37:20,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:20,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:20,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 1252 trivial. 0 not checked. [2019-09-07 19:37:30,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:37:30,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:37:30,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:37:30,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:37:30,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:37:30,375 INFO L87 Difference]: Start difference. First operand 780104 states and 853703 transitions. Second operand 4 states.