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_label19.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:30:54,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:30:54,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:30:54,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:30:54,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:30:54,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:30:54,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:30:54,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:30:54,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:30:54,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:30:54,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:30:54,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:30:54,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:30:54,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:30:54,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:30:54,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:30:54,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:30:54,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:30:54,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:30:54,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:30:54,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:30:54,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:30:54,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:30:54,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:30:54,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:30:54,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:30:54,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:30:54,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:30:54,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:30:54,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:30:54,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:30:54,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:30:54,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:30:54,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:30:54,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:30:54,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:30:54,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:30:54,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:30:54,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:30:54,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:30:54,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:30:54,378 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:30:54,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:30:54,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:30:54,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:30:54,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:30:54,411 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:30:54,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:30:54,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:30:54,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:30:54,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:30:54,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:30:54,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:30:54,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:30:54,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:30:54,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:30:54,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:30:54,415 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:30:54,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:30:54,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:30:54,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:30:54,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:30:54,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:30:54,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:30:54,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:30:54,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:30:54,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:30:54,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:30:54,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:30:54,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:30:54,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:30:54,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:30:54,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:30:54,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:30:54,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:30:54,473 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:30:54,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label19.c [2019-09-07 19:30:54,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe21fc6c9/fc04f34a21b44847b2f5f2b6b615bdec/FLAG84df39cb3 [2019-09-07 19:30:55,365 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:30:55,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label19.c [2019-09-07 19:30:55,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe21fc6c9/fc04f34a21b44847b2f5f2b6b615bdec/FLAG84df39cb3 [2019-09-07 19:30:55,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe21fc6c9/fc04f34a21b44847b2f5f2b6b615bdec [2019-09-07 19:30:55,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:30:55,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:30:55,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:30:55,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:30:55,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:30:55,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:30:55" (1/1) ... [2019-09-07 19:30:55,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164487eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:55, skipping insertion in model container [2019-09-07 19:30:55,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:30:55" (1/1) ... [2019-09-07 19:30:55,892 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:30:56,069 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:30:58,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:30:58,088 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:30:58,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:30:58,913 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:30:58,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58 WrapperNode [2019-09-07 19:30:58,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:30:58,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:30:58,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:30:58,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:30:58,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58" (1/1) ... [2019-09-07 19:30:58,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58" (1/1) ... [2019-09-07 19:30:58,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58" (1/1) ... [2019-09-07 19:30:58,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58" (1/1) ... [2019-09-07 19:30:59,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58" (1/1) ... [2019-09-07 19:30:59,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58" (1/1) ... [2019-09-07 19:30:59,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58" (1/1) ... [2019-09-07 19:30:59,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:30:59,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:30:59,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:30:59,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:30:59,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58" (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:30:59,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:30:59,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:30:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:30:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:30:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:30:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:30:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:30:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:30:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:30:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:30:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:30:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:30:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:30:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:30:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:30:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:30:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:31:05,158 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:31:05,158 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:31:05,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:31:05 BoogieIcfgContainer [2019-09-07 19:31:05,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:31:05,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:31:05,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:31:05,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:31:05,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:30:55" (1/3) ... [2019-09-07 19:31:05,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34895773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:31:05, skipping insertion in model container [2019-09-07 19:31:05,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:30:58" (2/3) ... [2019-09-07 19:31:05,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34895773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:31:05, skipping insertion in model container [2019-09-07 19:31:05,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:31:05" (3/3) ... [2019-09-07 19:31:05,171 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label19.c [2019-09-07 19:31:05,182 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:31:05,192 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:31:05,212 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:31:05,270 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:31:05,271 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:31:05,271 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:31:05,271 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:31:05,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:31:05,272 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:31:05,272 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:31:05,272 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:31:05,272 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:31:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:31:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 19:31:05,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:05,334 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] [2019-09-07 19:31:05,336 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:05,342 INFO L82 PathProgramCache]: Analyzing trace with hash -887553576, now seen corresponding path program 1 times [2019-09-07 19:31:05,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:05,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:05,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:05,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:05,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:31:05,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:31:05,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:31:05,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:31:05,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:31:05,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:31:05,652 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 4 states. [2019-09-07 19:31:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:15,177 INFO L93 Difference]: Finished difference Result 3964 states and 7388 transitions. [2019-09-07 19:31:15,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:31:15,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-07 19:31:15,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:15,243 INFO L225 Difference]: With dead ends: 3964 [2019-09-07 19:31:15,244 INFO L226 Difference]: Without dead ends: 2758 [2019-09-07 19:31:15,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:31:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-07 19:31:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1919. [2019-09-07 19:31:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2019-09-07 19:31:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 3313 transitions. [2019-09-07 19:31:15,475 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 3313 transitions. Word has length 23 [2019-09-07 19:31:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:15,476 INFO L475 AbstractCegarLoop]: Abstraction has 1919 states and 3313 transitions. [2019-09-07 19:31:15,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:31:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3313 transitions. [2019-09-07 19:31:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 19:31:15,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:15,484 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 19:31:15,484 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:15,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1116921583, now seen corresponding path program 1 times [2019-09-07 19:31:15,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:15,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:15,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:15,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:15,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:31:15,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:31:15,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:31:15,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:31:15,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:31:15,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:31:15,789 INFO L87 Difference]: Start difference. First operand 1919 states and 3313 transitions. Second operand 5 states. [2019-09-07 19:31:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:23,846 INFO L93 Difference]: Finished difference Result 5545 states and 9710 transitions. [2019-09-07 19:31:23,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:31:23,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-07 19:31:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:23,870 INFO L225 Difference]: With dead ends: 5545 [2019-09-07 19:31:23,870 INFO L226 Difference]: Without dead ends: 3632 [2019-09-07 19:31:23,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:31:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2019-09-07 19:31:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3623. [2019-09-07 19:31:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3623 states. [2019-09-07 19:31:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 5644 transitions. [2019-09-07 19:31:23,975 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 5644 transitions. Word has length 92 [2019-09-07 19:31:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:23,976 INFO L475 AbstractCegarLoop]: Abstraction has 3623 states and 5644 transitions. [2019-09-07 19:31:23,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:31:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 5644 transitions. [2019-09-07 19:31:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-07 19:31:23,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:23,979 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 19:31:23,979 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:23,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:23,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1730505973, now seen corresponding path program 1 times [2019-09-07 19:31:23,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:23,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:23,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:23,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:23,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:31:24,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:31:24,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:31:24,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:31:24,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:31:24,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:31:24,138 INFO L87 Difference]: Start difference. First operand 3623 states and 5644 transitions. Second operand 5 states. [2019-09-07 19:31:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:33,567 INFO L93 Difference]: Finished difference Result 10808 states and 17216 transitions. [2019-09-07 19:31:33,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:31:33,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-07 19:31:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:33,606 INFO L225 Difference]: With dead ends: 10808 [2019-09-07 19:31:33,609 INFO L226 Difference]: Without dead ends: 7191 [2019-09-07 19:31:33,620 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:31:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7191 states. [2019-09-07 19:31:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7191 to 7086. [2019-09-07 19:31:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7086 states. [2019-09-07 19:31:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 10105 transitions. [2019-09-07 19:31:33,865 INFO L78 Accepts]: Start accepts. Automaton has 7086 states and 10105 transitions. Word has length 94 [2019-09-07 19:31:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:33,866 INFO L475 AbstractCegarLoop]: Abstraction has 7086 states and 10105 transitions. [2019-09-07 19:31:33,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:31:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 7086 states and 10105 transitions. [2019-09-07 19:31:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-07 19:31:33,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:33,869 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 19:31:33,869 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2008970131, now seen corresponding path program 1 times [2019-09-07 19:31:33,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:33,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:33,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:31:34,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:31:34,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:31:34,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:31:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:31:34,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:31:34,056 INFO L87 Difference]: Start difference. First operand 7086 states and 10105 transitions. Second operand 3 states. [2019-09-07 19:31:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:39,480 INFO L93 Difference]: Finished difference Result 20817 states and 30786 transitions. [2019-09-07 19:31:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:31:39,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-07 19:31:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:39,544 INFO L225 Difference]: With dead ends: 20817 [2019-09-07 19:31:39,544 INFO L226 Difference]: Without dead ends: 13737 [2019-09-07 19:31:39,569 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:31:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-09-07 19:31:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13728. [2019-09-07 19:31:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13728 states. [2019-09-07 19:31:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13728 states to 13728 states and 18716 transitions. [2019-09-07 19:31:39,932 INFO L78 Accepts]: Start accepts. Automaton has 13728 states and 18716 transitions. Word has length 138 [2019-09-07 19:31:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:39,933 INFO L475 AbstractCegarLoop]: Abstraction has 13728 states and 18716 transitions. [2019-09-07 19:31:39,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:31:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 13728 states and 18716 transitions. [2019-09-07 19:31:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 19:31:39,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:39,936 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 19:31:39,936 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:39,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2121863739, now seen corresponding path program 1 times [2019-09-07 19:31:39,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:39,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:39,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:39,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:39,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:31:40,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:31:40,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:31:40,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:31:40,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:31:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:31:40,050 INFO L87 Difference]: Start difference. First operand 13728 states and 18716 transitions. Second operand 4 states. [2019-09-07 19:31:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:31:47,218 INFO L93 Difference]: Finished difference Result 31482 states and 42619 transitions. [2019-09-07 19:31:47,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:31:47,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-07 19:31:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:31:47,270 INFO L225 Difference]: With dead ends: 31482 [2019-09-07 19:31:47,271 INFO L226 Difference]: Without dead ends: 17760 [2019-09-07 19:31:47,300 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:31:47,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17760 states. [2019-09-07 19:31:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17760 to 16956. [2019-09-07 19:31:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16956 states. [2019-09-07 19:31:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16956 states to 16956 states and 20837 transitions. [2019-09-07 19:31:47,657 INFO L78 Accepts]: Start accepts. Automaton has 16956 states and 20837 transitions. Word has length 143 [2019-09-07 19:31:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:31:47,658 INFO L475 AbstractCegarLoop]: Abstraction has 16956 states and 20837 transitions. [2019-09-07 19:31:47,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:31:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 16956 states and 20837 transitions. [2019-09-07 19:31:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-07 19:31:47,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:31:47,666 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,667 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:31:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:31:47,667 INFO L82 PathProgramCache]: Analyzing trace with hash -13207614, now seen corresponding path program 1 times [2019-09-07 19:31:47,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:31:47,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:31:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:47,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:31:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:31:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:31:47,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:31:47,889 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) [2019-09-07 19:31:47,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:31:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:31:48,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:31:48,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:31:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 19:31:48,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:31:48,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 19:31:48,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:31:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:31:48,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:31:48,225 INFO L87 Difference]: Start difference. First operand 16956 states and 20837 transitions. Second operand 7 states. [2019-09-07 19:32:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:32:01,578 INFO L93 Difference]: Finished difference Result 42547 states and 53700 transitions. [2019-09-07 19:32:01,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:32:01,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 212 [2019-09-07 19:32:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:32:01,704 INFO L225 Difference]: With dead ends: 42547 [2019-09-07 19:32:01,705 INFO L226 Difference]: Without dead ends: 25597 [2019-09-07 19:32:01,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:32:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25597 states. [2019-09-07 19:32:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25597 to 22304. [2019-09-07 19:32:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22304 states. [2019-09-07 19:32:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22304 states to 22304 states and 25808 transitions. [2019-09-07 19:32:02,274 INFO L78 Accepts]: Start accepts. Automaton has 22304 states and 25808 transitions. Word has length 212 [2019-09-07 19:32:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:32:02,276 INFO L475 AbstractCegarLoop]: Abstraction has 22304 states and 25808 transitions. [2019-09-07 19:32:02,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:32:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 22304 states and 25808 transitions. [2019-09-07 19:32:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-07 19:32:02,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:32:02,286 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,287 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:32:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:32:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2025895704, now seen corresponding path program 1 times [2019-09-07 19:32:02,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:32:02,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:32:02,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:02,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:02,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 65 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:32:02,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:32:02,759 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:32:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:02,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:32:02,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:32:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-07 19:32:03,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:32:03,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:32:03,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:32:03,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:32:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:32:03,029 INFO L87 Difference]: Start difference. First operand 22304 states and 25808 transitions. Second operand 9 states. [2019-09-07 19:32:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:32:16,625 INFO L93 Difference]: Finished difference Result 77414 states and 94871 transitions. [2019-09-07 19:32:16,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 19:32:16,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 227 [2019-09-07 19:32:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:32:16,795 INFO L225 Difference]: With dead ends: 77414 [2019-09-07 19:32:16,795 INFO L226 Difference]: Without dead ends: 55116 [2019-09-07 19:32:16,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-07 19:32:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55116 states. [2019-09-07 19:32:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55116 to 53020. [2019-09-07 19:32:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53020 states. [2019-09-07 19:32:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53020 states to 53020 states and 62798 transitions. [2019-09-07 19:32:17,776 INFO L78 Accepts]: Start accepts. Automaton has 53020 states and 62798 transitions. Word has length 227 [2019-09-07 19:32:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:32:17,776 INFO L475 AbstractCegarLoop]: Abstraction has 53020 states and 62798 transitions. [2019-09-07 19:32:17,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:32:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 53020 states and 62798 transitions. [2019-09-07 19:32:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-07 19:32:17,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:32:17,786 INFO L399 BasicCegarLoop]: trace histogram [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, 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:32:17,786 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:32:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:32:17,787 INFO L82 PathProgramCache]: Analyzing trace with hash -679434695, now seen corresponding path program 1 times [2019-09-07 19:32:17,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:32:17,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:32:17,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:17,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:17,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:18,183 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-09-07 19:32:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 128 proven. 78 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 19:32:18,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:32:18,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:32:18,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:18,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:32:18,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:32:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 264 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-07 19:32:18,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:32:18,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:32:18,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:32:18,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:32:18,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:32:18,701 INFO L87 Difference]: Start difference. First operand 53020 states and 62798 transitions. Second operand 9 states. [2019-09-07 19:32:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:32:34,213 INFO L93 Difference]: Finished difference Result 136028 states and 174782 transitions. [2019-09-07 19:32:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:32:34,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2019-09-07 19:32:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:32:34,520 INFO L225 Difference]: With dead ends: 136028 [2019-09-07 19:32:34,520 INFO L226 Difference]: Without dead ends: 82192 [2019-09-07 19:32:34,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:32:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82192 states. [2019-09-07 19:32:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82192 to 78716. [2019-09-07 19:32:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78716 states. [2019-09-07 19:32:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78716 states to 78716 states and 98471 transitions. [2019-09-07 19:32:37,927 INFO L78 Accepts]: Start accepts. Automaton has 78716 states and 98471 transitions. Word has length 300 [2019-09-07 19:32:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:32:37,927 INFO L475 AbstractCegarLoop]: Abstraction has 78716 states and 98471 transitions. [2019-09-07 19:32:37,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:32:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 78716 states and 98471 transitions. [2019-09-07 19:32:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-07 19:32:37,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:32:37,938 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,939 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:32:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:32:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1431252355, now seen corresponding path program 1 times [2019-09-07 19:32:37,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:32:37,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:32:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:37,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-09-07 19:32:38,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:32:38,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:32:38,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:32:38,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:32:38,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:32:38,135 INFO L87 Difference]: Start difference. First operand 78716 states and 98471 transitions. Second operand 3 states. [2019-09-07 19:32:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:32:44,353 INFO L93 Difference]: Finished difference Result 156637 states and 196314 transitions. [2019-09-07 19:32:44,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:32:44,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-09-07 19:32:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:32:44,594 INFO L225 Difference]: With dead ends: 156637 [2019-09-07 19:32:44,594 INFO L226 Difference]: Without dead ends: 78730 [2019-09-07 19:32:44,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:32:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78730 states. [2019-09-07 19:32:48,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78730 to 77880. [2019-09-07 19:32:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77880 states. [2019-09-07 19:32:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77880 states to 77880 states and 91195 transitions. [2019-09-07 19:32:48,353 INFO L78 Accepts]: Start accepts. Automaton has 77880 states and 91195 transitions. Word has length 301 [2019-09-07 19:32:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:32:48,354 INFO L475 AbstractCegarLoop]: Abstraction has 77880 states and 91195 transitions. [2019-09-07 19:32:48,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:32:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 77880 states and 91195 transitions. [2019-09-07 19:32:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-07 19:32:48,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:32:48,369 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 19:32:48,370 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:32:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:32:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 800104931, now seen corresponding path program 1 times [2019-09-07 19:32:48,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:32:48,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:32:48,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:48,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:32:48,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:32:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:32:48,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:32:48,631 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) [2019-09-07 19:32:48,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:32:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:32:48,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:32:48,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:32:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-07 19:32:48,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:32:48,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:32:48,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:32:48,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:32:48,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:32:48,847 INFO L87 Difference]: Start difference. First operand 77880 states and 91195 transitions. Second operand 9 states. [2019-09-07 19:33:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:33:01,179 INFO L93 Difference]: Finished difference Result 157895 states and 185075 transitions. [2019-09-07 19:33:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:33:01,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 330 [2019-09-07 19:33:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:33:01,781 INFO L225 Difference]: With dead ends: 157895 [2019-09-07 19:33:01,781 INFO L226 Difference]: Without dead ends: 80010 [2019-09-07 19:33:01,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:33:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80010 states. [2019-09-07 19:33:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80010 to 78949. [2019-09-07 19:33:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78949 states. [2019-09-07 19:33:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78949 states to 78949 states and 87529 transitions. [2019-09-07 19:33:02,915 INFO L78 Accepts]: Start accepts. Automaton has 78949 states and 87529 transitions. Word has length 330 [2019-09-07 19:33:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:33:02,916 INFO L475 AbstractCegarLoop]: Abstraction has 78949 states and 87529 transitions. [2019-09-07 19:33:02,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:33:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 78949 states and 87529 transitions. [2019-09-07 19:33:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-07 19:33:02,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:33:02,930 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,930 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:33:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:33:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1823273741, now seen corresponding path program 1 times [2019-09-07 19:33:02,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:33:02,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:33:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:02,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:33:03,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:33:03,159 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:33:03,174 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:33:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:03,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 19:33:03,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:33:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-07 19:33:03,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:33:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 19:33:03,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:33:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:33:03,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:33:03,395 INFO L87 Difference]: Start difference. First operand 78949 states and 87529 transitions. Second operand 7 states. [2019-09-07 19:33:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:33:17,220 INFO L93 Difference]: Finished difference Result 177328 states and 198126 transitions. [2019-09-07 19:33:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 19:33:17,221 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 368 [2019-09-07 19:33:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:33:17,428 INFO L225 Difference]: With dead ends: 177328 [2019-09-07 19:33:17,429 INFO L226 Difference]: Without dead ends: 99188 [2019-09-07 19:33:17,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:33:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99188 states. [2019-09-07 19:33:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99188 to 94295. [2019-09-07 19:33:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94295 states. [2019-09-07 19:33:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94295 states to 94295 states and 103972 transitions. [2019-09-07 19:33:18,699 INFO L78 Accepts]: Start accepts. Automaton has 94295 states and 103972 transitions. Word has length 368 [2019-09-07 19:33:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:33:18,701 INFO L475 AbstractCegarLoop]: Abstraction has 94295 states and 103972 transitions. [2019-09-07 19:33:18,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:33:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 94295 states and 103972 transitions. [2019-09-07 19:33:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-09-07 19:33:18,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:33:18,724 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:33:18,725 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:33:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:33:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1273654972, now seen corresponding path program 1 times [2019-09-07 19:33:18,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:33:18,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:33:18,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:18,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:18,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 249 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:33:19,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:33:19,161 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) [2019-09-07 19:33:19,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:33:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:19,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:33:19,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:33:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 249 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:33:20,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:33:20,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:33:20,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:33:20,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:33:20,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:33:20,008 INFO L87 Difference]: Start difference. First operand 94295 states and 103972 transitions. Second operand 9 states. [2019-09-07 19:33:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:33:34,653 INFO L93 Difference]: Finished difference Result 195680 states and 223623 transitions. [2019-09-07 19:33:34,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:33:34,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 394 [2019-09-07 19:33:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:33:34,937 INFO L225 Difference]: With dead ends: 195680 [2019-09-07 19:33:34,938 INFO L226 Difference]: Without dead ends: 102194 [2019-09-07 19:33:35,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:33:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102194 states. [2019-09-07 19:33:36,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102194 to 100112. [2019-09-07 19:33:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100112 states. [2019-09-07 19:33:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100112 states to 100112 states and 106841 transitions. [2019-09-07 19:33:37,104 INFO L78 Accepts]: Start accepts. Automaton has 100112 states and 106841 transitions. Word has length 394 [2019-09-07 19:33:37,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:33:37,105 INFO L475 AbstractCegarLoop]: Abstraction has 100112 states and 106841 transitions. [2019-09-07 19:33:37,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:33:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 100112 states and 106841 transitions. [2019-09-07 19:33:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-09-07 19:33:37,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:33:37,131 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 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:37,131 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:33:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:33:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash -991164948, now seen corresponding path program 1 times [2019-09-07 19:33:37,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:33:37,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:33:37,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:37,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:37,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 53 proven. 301 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-07 19:33:37,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:33:37,501 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:33:37,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:37,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:33:37,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:33:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 444 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-07 19:33:37,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:33:37,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:33:37,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:33:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:33:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:33:37,802 INFO L87 Difference]: Start difference. First operand 100112 states and 106841 transitions. Second operand 9 states. [2019-09-07 19:33:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:33:47,809 INFO L93 Difference]: Finished difference Result 199286 states and 213461 transitions. [2019-09-07 19:33:47,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 19:33:47,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 480 [2019-09-07 19:33:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:33:47,975 INFO L225 Difference]: With dead ends: 199286 [2019-09-07 19:33:47,975 INFO L226 Difference]: Without dead ends: 94147 [2019-09-07 19:33:48,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 485 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:33:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94147 states. [2019-09-07 19:33:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94147 to 87549. [2019-09-07 19:33:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87549 states. [2019-09-07 19:33:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87549 states to 87549 states and 92766 transitions. [2019-09-07 19:33:48,902 INFO L78 Accepts]: Start accepts. Automaton has 87549 states and 92766 transitions. Word has length 480 [2019-09-07 19:33:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:33:48,902 INFO L475 AbstractCegarLoop]: Abstraction has 87549 states and 92766 transitions. [2019-09-07 19:33:48,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:33:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 87549 states and 92766 transitions. [2019-09-07 19:33:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-07 19:33:48,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:33:48,923 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,924 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:33:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:33:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2079293318, now seen corresponding path program 1 times [2019-09-07 19:33:48,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:33:48,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:33:48,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:48,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:33:48,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:33:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:33:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-09-07 19:33:51,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:33:51,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:33:51,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:33:51,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:33:51,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:33:51,233 INFO L87 Difference]: Start difference. First operand 87549 states and 92766 transitions. Second operand 4 states. [2019-09-07 19:34:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:34:00,858 INFO L93 Difference]: Finished difference Result 257586 states and 275057 transitions. [2019-09-07 19:34:00,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:34:00,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 499 [2019-09-07 19:34:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:34:01,164 INFO L225 Difference]: With dead ends: 257586 [2019-09-07 19:34:01,165 INFO L226 Difference]: Without dead ends: 171678 [2019-09-07 19:34:01,228 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:34:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171678 states. [2019-09-07 19:34:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171678 to 128106. [2019-09-07 19:34:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128106 states. [2019-09-07 19:34:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128106 states to 128106 states and 136651 transitions. [2019-09-07 19:34:02,664 INFO L78 Accepts]: Start accepts. Automaton has 128106 states and 136651 transitions. Word has length 499 [2019-09-07 19:34:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:34:02,664 INFO L475 AbstractCegarLoop]: Abstraction has 128106 states and 136651 transitions. [2019-09-07 19:34:02,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:34:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 128106 states and 136651 transitions. [2019-09-07 19:34:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2019-09-07 19:34:02,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:34:02,730 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,731 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:34:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:34:02,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1750442455, now seen corresponding path program 1 times [2019-09-07 19:34:02,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:34:02,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:34:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 500 proven. 2 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2019-09-07 19:34:03,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:34:03,667 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:34:03,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:03,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:34:03,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:34:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:34:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-09-07 19:34:04,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:34:04,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:34:04,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:34:04,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:34:04,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:34:04,997 INFO L87 Difference]: Start difference. First operand 128106 states and 136651 transitions. Second operand 9 states. [2019-09-07 19:34:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:34:21,407 INFO L93 Difference]: Finished difference Result 286687 states and 305955 transitions. [2019-09-07 19:34:21,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 19:34:21,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 833 [2019-09-07 19:34:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:34:21,774 INFO L225 Difference]: With dead ends: 286687 [2019-09-07 19:34:21,774 INFO L226 Difference]: Without dead ends: 160222 [2019-09-07 19:34:21,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 844 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-09-07 19:34:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160222 states. [2019-09-07 19:34:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160222 to 158464. [2019-09-07 19:34:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158464 states. [2019-09-07 19:34:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158464 states to 158464 states and 168113 transitions. [2019-09-07 19:34:27,469 INFO L78 Accepts]: Start accepts. Automaton has 158464 states and 168113 transitions. Word has length 833 [2019-09-07 19:34:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:34:27,470 INFO L475 AbstractCegarLoop]: Abstraction has 158464 states and 168113 transitions. [2019-09-07 19:34:27,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:34:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 158464 states and 168113 transitions. [2019-09-07 19:34:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2019-09-07 19:34:27,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:34:27,567 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:34:27,567 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:34:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:34:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash -455086362, now seen corresponding path program 1 times [2019-09-07 19:34:27,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:34:27,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:34:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:27,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:27,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:34:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 159 proven. 679 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-09-07 19:34:29,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:34:29,673 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:34:29,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:34:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:34:29,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:34:29,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:34:30,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:34:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 797 proven. 2 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-07 19:34:30,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:34:30,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:34:30,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:34:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:34:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:34:30,867 INFO L87 Difference]: Start difference. First operand 158464 states and 168113 transitions. Second operand 16 states. [2019-09-07 19:35:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:35:15,466 INFO L93 Difference]: Finished difference Result 383672 states and 409060 transitions. [2019-09-07 19:35:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-07 19:35:15,466 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1130 [2019-09-07 19:35:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:35:15,923 INFO L225 Difference]: With dead ends: 383672 [2019-09-07 19:35:15,923 INFO L226 Difference]: Without dead ends: 217504 [2019-09-07 19:35:16,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1319 GetRequests, 1209 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4695 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1752, Invalid=10458, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 19:35:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217504 states. [2019-09-07 19:35:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217504 to 209139. [2019-09-07 19:35:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209139 states. [2019-09-07 19:35:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209139 states to 209139 states and 220603 transitions. [2019-09-07 19:35:18,807 INFO L78 Accepts]: Start accepts. Automaton has 209139 states and 220603 transitions. Word has length 1130 [2019-09-07 19:35:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:35:18,807 INFO L475 AbstractCegarLoop]: Abstraction has 209139 states and 220603 transitions. [2019-09-07 19:35:18,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:35:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 209139 states and 220603 transitions. [2019-09-07 19:35:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1195 [2019-09-07 19:35:18,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:35:18,894 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,895 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:35:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:35:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1244557854, now seen corresponding path program 1 times [2019-09-07 19:35:18,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:35:18,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:35:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:18,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:35:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1706 backedges. 421 proven. 910 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2019-09-07 19:35:27,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:35:27,372 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:35:27,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:35:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:35:27,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:35:27,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:35:27,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:35:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1706 backedges. 885 proven. 2 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2019-09-07 19:35:28,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:35:28,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2019-09-07 19:35:28,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 19:35:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 19:35:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-07 19:35:28,439 INFO L87 Difference]: Start difference. First operand 209139 states and 220603 transitions. Second operand 21 states. [2019-09-07 19:35:29,360 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-07 19:35:32,858 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-07 19:35:35,840 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-07 19:35:41,374 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-07 19:35:43,220 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-07 19:35:43,572 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2019-09-07 19:35:43,913 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-07 19:35:44,191 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-07 19:35:44,989 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-07 19:35:45,264 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-07 19:35:46,227 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-07 19:35:46,400 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-07 19:35:47,784 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-07 19:35:48,044 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-07 19:35:49,342 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-07 19:35:49,680 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-07 19:35:50,674 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 19:35:50,935 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-07 19:35:51,281 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-07 19:35:52,083 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-07 19:35:52,806 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-07 19:35:55,655 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-07 19:35:56,226 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-07 19:35:56,700 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-07 19:35:57,062 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-07 19:35:59,764 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-07 19:36:00,159 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-07 19:36:00,591 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-07 19:36:01,353 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-07 19:36:01,719 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-07 19:36:03,330 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-07 19:36:04,117 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-07 19:36:04,877 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-07 19:36:05,629 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-07 19:36:07,308 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-07 19:36:09,763 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-07 19:36:11,265 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-07 19:36:14,257 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 19:36:16,650 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-07 19:36:20,090 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-07 19:36:20,292 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-07 19:36:22,549 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-07 19:36:24,314 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-07 19:36:25,089 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-09-07 19:36:25,780 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-07 19:36:32,818 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-07 19:36:36,795 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-07 19:36:37,004 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-07 19:36:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:36:42,601 INFO L93 Difference]: Finished difference Result 482043 states and 510224 transitions. [2019-09-07 19:36:42,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2019-09-07 19:36:42,602 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1194 [2019-09-07 19:36:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:36:43,174 INFO L225 Difference]: With dead ends: 482043 [2019-09-07 19:36:43,174 INFO L226 Difference]: Without dead ends: 277741 [2019-09-07 19:36:43,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1557 GetRequests, 1350 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17731 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=5195, Invalid=38277, Unknown=0, NotChecked=0, Total=43472 [2019-09-07 19:36:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277741 states. [2019-09-07 19:36:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277741 to 264452. [2019-09-07 19:36:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264452 states. [2019-09-07 19:36:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264452 states to 264452 states and 279129 transitions. [2019-09-07 19:36:46,548 INFO L78 Accepts]: Start accepts. Automaton has 264452 states and 279129 transitions. Word has length 1194 [2019-09-07 19:36:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:36:46,549 INFO L475 AbstractCegarLoop]: Abstraction has 264452 states and 279129 transitions. [2019-09-07 19:36:46,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 19:36:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 264452 states and 279129 transitions. [2019-09-07 19:36:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1491 [2019-09-07 19:36:46,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:36:46,667 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:36:46,668 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:36:46,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:36:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash 472293427, now seen corresponding path program 1 times [2019-09-07 19:36:46,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:36:46,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:36:46,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:46,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:36:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:49,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3112 backedges. 781 proven. 442 refuted. 0 times theorem prover too weak. 1889 trivial. 0 not checked. [2019-09-07 19:36:49,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:36:49,421 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:36:49,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:36:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:36:50,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 1970 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 19:36:50,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:36:50,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:50,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:36:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3112 backedges. 2311 proven. 2 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2019-09-07 19:36:51,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:36:51,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 19:36:51,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:36:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:36:51,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:36:51,488 INFO L87 Difference]: Start difference. First operand 264452 states and 279129 transitions. Second operand 8 states. [2019-09-07 19:37:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:08,809 INFO L93 Difference]: Finished difference Result 597416 states and 632291 transitions. [2019-09-07 19:37:08,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:37:08,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1490 [2019-09-07 19:37:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:10,224 INFO L225 Difference]: With dead ends: 597416 [2019-09-07 19:37:10,224 INFO L226 Difference]: Without dead ends: 340215 [2019-09-07 19:37:10,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1518 GetRequests, 1499 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-09-07 19:37:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340215 states. [2019-09-07 19:37:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340215 to 328137. [2019-09-07 19:37:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328137 states. [2019-09-07 19:37:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328137 states to 328137 states and 345693 transitions. [2019-09-07 19:37:18,186 INFO L78 Accepts]: Start accepts. Automaton has 328137 states and 345693 transitions. Word has length 1490 [2019-09-07 19:37:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:18,188 INFO L475 AbstractCegarLoop]: Abstraction has 328137 states and 345693 transitions. [2019-09-07 19:37:18,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:37:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 328137 states and 345693 transitions. [2019-09-07 19:37:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1514 [2019-09-07 19:37:19,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:19,613 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:37:19,613 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:19,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1846308720, now seen corresponding path program 1 times [2019-09-07 19:37:19,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:19,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:19,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:19,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:19,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 1431 proven. 306 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-09-07 19:37:27,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:27,789 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:37:27,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:28,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:37:28,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:28,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:37:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 1675 proven. 2 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2019-09-07 19:37:29,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:37:29,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 24 [2019-09-07 19:37:29,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 19:37:29,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 19:37:29,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-09-07 19:37:29,152 INFO L87 Difference]: Start difference. First operand 328137 states and 345693 transitions. Second operand 24 states. [2019-09-07 19:38:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:37,907 INFO L93 Difference]: Finished difference Result 636223 states and 675839 transitions. [2019-09-07 19:38:37,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-09-07 19:38:37,909 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1513 [2019-09-07 19:38:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:38,791 INFO L225 Difference]: With dead ends: 636223 [2019-09-07 19:38:38,791 INFO L226 Difference]: Without dead ends: 341889 [2019-09-07 19:38:39,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1831 GetRequests, 1656 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12496 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4530, Invalid=26622, Unknown=0, NotChecked=0, Total=31152 [2019-09-07 19:38:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341889 states. [2019-09-07 19:38:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341889 to 331626. [2019-09-07 19:38:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331626 states. [2019-09-07 19:38:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331626 states to 331626 states and 348588 transitions. [2019-09-07 19:38:44,368 INFO L78 Accepts]: Start accepts. Automaton has 331626 states and 348588 transitions. Word has length 1513 [2019-09-07 19:38:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:44,369 INFO L475 AbstractCegarLoop]: Abstraction has 331626 states and 348588 transitions. [2019-09-07 19:38:44,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 19:38:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 331626 states and 348588 transitions. [2019-09-07 19:38:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1519 [2019-09-07 19:38:44,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:44,530 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:38:44,530 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:44,531 INFO L82 PathProgramCache]: Analyzing trace with hash 950295017, now seen corresponding path program 1 times [2019-09-07 19:38:44,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:44,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:44,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:44,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:44,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 353 proven. 331 refuted. 0 times theorem prover too weak. 1344 trivial. 0 not checked. [2019-09-07 19:38:48,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:48,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:38:48,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:49,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 19:38:49,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:49,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:38:49,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:38:49,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:38:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1531 proven. 13 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 19:38:52,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:38:52,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 19:38:52,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 19:38:52,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 19:38:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:38:52,108 INFO L87 Difference]: Start difference. First operand 331626 states and 348588 transitions. Second operand 13 states. [2019-09-07 19:40:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:00,356 INFO L93 Difference]: Finished difference Result 671086 states and 707020 transitions. [2019-09-07 19:40:00,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-09-07 19:40:00,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1518 [2019-09-07 19:40:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:01,232 INFO L225 Difference]: With dead ends: 671086 [2019-09-07 19:40:01,232 INFO L226 Difference]: Without dead ends: 373386 [2019-09-07 19:40:01,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1732 GetRequests, 1610 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5984 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2077, Invalid=13175, Unknown=0, NotChecked=0, Total=15252 [2019-09-07 19:40:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373386 states. [2019-09-07 19:40:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373386 to 356852. [2019-09-07 19:40:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356852 states. [2019-09-07 19:40:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356852 states to 356852 states and 374844 transitions. [2019-09-07 19:40:13,847 INFO L78 Accepts]: Start accepts. Automaton has 356852 states and 374844 transitions. Word has length 1518 [2019-09-07 19:40:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:13,847 INFO L475 AbstractCegarLoop]: Abstraction has 356852 states and 374844 transitions. [2019-09-07 19:40:13,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 19:40:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 356852 states and 374844 transitions. [2019-09-07 19:40:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1532 [2019-09-07 19:40:13,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:13,978 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 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:40:13,978 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash -770195813, now seen corresponding path program 1 times [2019-09-07 19:40:13,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:13,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:13,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:13,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:13,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 949 proven. 6 refuted. 0 times theorem prover too weak. 1718 trivial. 0 not checked. [2019-09-07 19:40:19,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:19,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:40:19,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:20,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 19:40:20,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:20,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:40:20,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:40:20,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:40:20,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:40:22,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:40:22,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:40:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 1849 proven. 5 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2019-09-07 19:40:24,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:40:24,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-07 19:40:24,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 19:40:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 19:40:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2019-09-07 19:40:24,275 INFO L87 Difference]: Start difference. First operand 356852 states and 374844 transitions. Second operand 14 states. [2019-09-07 19:40:29,672 WARN L188 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2019-09-07 19:41:12,766 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-09-07 19:41:49,075 WARN L188 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 34 DAG size of output: 20